A lexicographic algebraic theorem and its applications
From MaRDI portal
Publication:1307556
DOI10.1016/S0024-3795(98)00002-0zbMath0946.90109WikidataQ127677653 ScholiaQ127677653MaRDI QIDQ1307556
Publication date: 19 December 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Extreme-point and pivoting methods (90C49)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Submodular functions and optimization
- The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
- On structures of bisubmodular polyhedra
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
- A class of simplicial restart fixed point algorithms without an extra dimension
- The octahedral algorithm, a new simplicial fixed point algorithm
- A restart algorithm for computing fixed points without an extra dimension
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
