Lexicographical polytopes

DOI10.1016/J.DAM.2017.04.022zbMATH Open1395.90186OpenAlexW4206275369MaRDI QIDQ1707907FDOQ1707907

Authors Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira 

Publication date 4 April 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2434/751038

zbMATH Keywords

polyhedral descriptionlexicographical polytopessuperdecreasing knapsacks

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Lexicographic maximum of convex polyhedral set
• Properties of lexicographic maximum of convex compact
• Convex hull characterizations of lexicographic orderings
• Revlex-initial 0/1-polytopes
• Lexicographical representation of convex sets

Cites work

• scientific article; zbMATH DE number 4213909 (Why is no real title available?)
• A characterization of knapsacks with the max-flow--min-cut property
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Forbidden vertices
• Ideal representations of lexicographic orderings and base-2 expansions of integer variables
• Reformulation and decomposition of integer programs
• Revlex-initial 0/1-polytopes

Cited in

(4)

• Matrices with lexicographically-ordered rows
• Lexicographic maximum of convex polyhedral set
• Convex hull characterizations of lexicographic orderings
• The \(st\)-bond polytope on series-parallel graphs

This page was built for publication: Lexicographical polytopes

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