A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix

DOI10.1007/978-3-319-45587-7_2MaRDI QIDQ2835658zbMATHOpenAlexFDO

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

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45587-7_2

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computational aspects related to convexity (52B55)

Recommendations

• Complete formulations of polytopes related to extensions of assignment matrices
• On multi-index assignment polytopes
• Facets of the three-index assignment polytope
• scientific article; zbMATH DE number 1894378
• Adjacency on the constrained assignment problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Extended and discretized formulations for the maximum clique problem
• On the most imbalanced orientation of a graph

Cited in

(1)

• Complete formulations of polytopes related to extensions of assignment matrices

This page was built for publication: A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix

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