scientific article; zbMATH DE number 69364

zbMATH Open0756.05096MaRDI QIDQ4014835FDOQ4014835

Authors: Paul Armand 

Publication date: 21 October 1992

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

linear programmingboundsconnectednessoptimal edgesperturbed polyhedra

Mathematics Subject Classification ID

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

Cited In (6)

• Combinatorial behavior of extreme points of perturbed polyhedra
• Refuting conjectures in extremal combinatorics via linear programming
• Bounds on the number of vertices of perturbed polyhedra
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Title not available (Why is that?)
• Nondegeneracy of polyhedra and linear programs

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)