Convex hull characterizations of lexicographic orderings

DOI10.1007/s10898-016-0435-3zbMath1379.90016OpenAlexW2343090527MaRDI QIDQ330274

Pietro Belotti, Ruobing Shen, Warren P. Adams

Publication date: 25 October 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11311/1163721

zbMATH Keywords

convex hullknapsack problemfacets

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Exact lexicographic scheduling and approximate rescheduling

Cites Work

• Unnamed Item
• Orbitopal fixing
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Packing and partitioning orbitopes
• A characterization of knapsacks with the max-flow--min-cut property
• The matroids with the max-flow min-cut property
• Pure 0-1 programming approaches to wireless network design. (Summary)
• Ideal representations of lexicographic orderings and base-2 expansions of integer variables
• Revlex-initial 0/1-polytopes
• Extended Formulations for Packing and Partitioning Orbitopes
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Optimal Capacity Scheduling—I