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_2zbMath1432.52025OpenAlexW2511464872MaRDI QIDQ2835658

Walid Ben-Ameur, José Neto, Antoine Glorieux

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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: A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix