Ideal representations of lexicographic orderings and base-2 expansions of integer variables
From MaRDI portal
Publication:2376730
DOI10.1016/J.ORL.2012.10.005zbMATH Open1266.90131OpenAlexW2011002627MaRDI QIDQ2376730FDOQ2376730
Authors: Frank Muldoon, Warren P. Adams, Hanif D. Sherali
Publication date: 24 June 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.10.005
Recommendations
Cited In (9)
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Exact lexicographic scheduling and approximate rescheduling
- 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)