Convex hull characterizations of lexicographic orderings
From MaRDI portal
(Redirected from Publication:330274)
Recommendations
Cites work
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- A characterization of knapsacks with the max-flow--min-cut property
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Extended formulations for packing and partitioning orbitopes
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Optimal Capacity Scheduling—I
- Orbitopal fixing
- Packing and partitioning orbitopes
- Pure 0-1 programming approaches to wireless network design. (Summary)
- Revlex-initial 0/1-polytopes
- The matroids with the max-flow min-cut property
Cited in
(8)- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Lexicographical representation of convex sets
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Exact lexicographic scheduling and approximate rescheduling
- Order-k -hulls and -shapes
- Lexicographical order in integer programming
- Lexicographical polytopes
- Matrices with lexicographically-ordered rows
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)
