Complete formulations of polytopes related to extensions of assignment matrices

DOI10.1016/J.DISOPT.2018.04.002zbMATH Open1506.90215OpenAlexW2801998034MaRDI QIDQ1662654FDOQ1662654

Authors: Walid Ben-Ameur, Antoine Glorieux, José Neto 

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

Recommendations

• A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
• On the extension complexity of scheduling polytopes
• Extended formulations in combinatorial optimization
• Extended formulations in combinatorial optimization
• On the facial structure of scheduling polyhedra

zbMATH Keywords

assignment problemspolytopecompact formulationseparationcomplete formulation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Disjunctive programming: Properties of the convex hull of feasible points
• Title not available (Why is that?)
• Extended and discretized formulations for the maximum clique problem
• On the most imbalanced orientation of a graph

Cited In (2)

• A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
• The \(k\)-assignment polytope

Uses Software

• PORTA

This page was built for publication: Complete formulations of polytopes related to extensions of assignment matrices

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