Ideal representations of lexicographic orderings and base-2 expansions of integer variables
From MaRDI portal
Publication:2376730
Recommendations
Cited in
(9)- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Exact lexicographic scheduling and approximate rescheduling
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Mixed integer linear programming formulation techniques
- Convex hull characterizations of lexicographic orderings
- Encoding binary arithmetic operations in integer programming formulations
- Lexicographical polytopes
- Modeling combinatorial disjunctive constraints via junction trees
- Forbidden vertices
This page was built for publication: Ideal representations of lexicographic orderings and base-2 expansions of integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376730)