Complete formulations of polytopes related to extensions of assignment matrices
From MaRDI portal
Publication:1662654
DOI10.1016/j.disopt.2018.04.002zbMath1506.90215OpenAlexW2801998034MaRDI QIDQ1662654
José Neto, Antoine Glorieux, Walid Ben-Ameur
Publication date: 20 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.04.002
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- The ellipsoid method and its consequences in combinatorial optimization
- Disjunctive programming: Properties of the convex hull of feasible points
- Extended and discretized formulations for the maximum clique problem
- On the Most Imbalanced Orientation of a Graph
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
This page was built for publication: Complete formulations of polytopes related to extensions of assignment matrices