A characterization of odd-hole inequalities related to Latin squares
From MaRDI portal
Publication:2868928
DOI10.1080/02331934.2011.611510zbMath1278.90258OpenAlexW2006516309MaRDI QIDQ2868928
No author found.
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.611510
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Uses Software
Cites Work
- The complexity of completing partial Latin squares
- On the completability of incomplete Latin squares
- Geometric algorithms and combinatorial optimization.
- An algorithm for the planar three-index assignment problem
- On Latin squares and the facial structure of related polytopes
- Complexity of a 3-dimensional assignment problem
- Time-tables, polyhedra and the greedy algorithm
- Tabu search for the planar three-index assignment problem
- Facets of the three-index assignment polytope
- A new class of facets for the Latin square polytope
- On multi-index assignment polytopes
- Fast local search algorithms for the handicapped persons transportation problem
- An Algorithm for the Three-Index Assignment Problem
- On the facial structure of set packing polyhedra
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
This page was built for publication: A characterization of odd-hole inequalities related to Latin squares
