scientific article; zbMATH DE number 69364

MaRDI QIDQ4014835zbMATH OpenFDO

Authors Paul Armand

Publication date 21 October 1992

zbMATH Keywords

boundsconnectednesslinear programmingoptimal edgesperturbed polyhedra

Mathematics Subject Classification ID

Graph theory (05C99) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Recommendations

• Bounds on the number of vertices of perturbed polyhedra
• Combinatorial behavior of extreme points of perturbed polyhedra
• Linear programming, the simplex algorithm and simple polytopes
• scientific article; zbMATH DE number 803180
• Some perturbation theory for linear programming

Cited in

(6)

• Combinatorial behavior of extreme points of perturbed polyhedra
• Bounds on the number of vertices of perturbed polyhedra
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Nondegeneracy of polyhedra and linear programs
• Refuting conjectures in extremal combinatorics via linear programming
• scientific article; zbMATH DE number 1379519 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014835)