scientific article
From MaRDI portal
Publication:2707294
zbMath1052.90100MaRDI QIDQ2707294
Publication date: 1 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27) Extreme-point and pivoting methods (90C49)
Related Items (6)
Diameters of cocircuit graphs of oriented matroids: an update ⋮ On the existence of a short pivoting sequence for a linear program ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Computing monotone disjoint paths on polytopes ⋮ Pivot versus interior point methods: Pros and cons
This page was built for publication:
