Convex hull characterizations of lexicographic orderings

DOI10.1007/S10898-016-0435-3zbMATH Open1379.90016OpenAlexW2343090527MaRDI QIDQ330274FDOQ330274

Pietro Belotti, Warren P. Adams, Ruobing Shen

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

Recommendations

• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Ideal representations of lexicographic orderings and base-2 expansions of integer variables
• Matrices with lexicographically-ordered rows
• Lexicographical polytopes
• Lexicographical order in integer programming

zbMATH Keywords

convex hullknapsack problemfacets

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Convex hulls of superincreasing knapsacks and lexicographic orderings
• Exact lexicographic scheduling and approximate rescheduling
• Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes

This page was built for publication: Convex hull characterizations of lexicographic orderings

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