This is a preview. Log in through your library . Abstract In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, ...

Recently, the globally uniquely solvable (GUS) property of the linear transformation M ∈ ℝn × n in the second-order cone linear complementarity problem (SOCLCP) receives much attention and has been ...

Graph partitioning and bisection problems occupy a central position in combinatorial optimisation and theoretical computer science. These issues involve dividing a graph’s vertex set into distinct ...