Time-tables, polyhedra and the greedy algorithm
From MaRDI portal
Publication:1917272
DOI10.1016/0166-218X(95)00036-QzbMath0854.68036MaRDI QIDQ1917272
Hervé Le Verge, Reinhardt Euler
Publication date: 5 January 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (5)
On the completability of incomplete Latin squares ⋮ Selected topics on assignment problems ⋮ On multi-index assignment polytopes ⋮ Clique facets of the axial and planar assignment polytopes ⋮ A characterization of odd-hole inequalities related to Latin squares
Cites Work
- Unnamed Item
- Generalized latin rectangles. II: Embedding
- On Latin squares and the facial structure of related polytopes
- Facet of regular 0–1 polytopes
- Some Comments On A Note About Timetabling*
- On the facial structure of set packing polyhedra
- A Combinatorial Theorem with an Application to Latin Rectangles
This page was built for publication: Time-tables, polyhedra and the greedy algorithm
