A characterization of odd-hole inequalities related to Latin squares

References

• Appa , G , Magos , D and Mourtos , I . 2006 . A new class of facets for the Latin square polytope . Discrete Appl. Math. , 154 : 900 – 911 .
   Web of Science ®Google Scholar
• Appa , G , Magos , D and Mourtos , I . 2006 . On multi-index assignment polytopes . Linear Algebra Appl. , 416 : 224 – 241 .
   Web of Science ®Google Scholar
• Balas , E and Saltzman , MJ . 1989 . Facets of the three-index assignment polytope . Discrete Appl. Math. , 23 : 201 – 229 .
   Web of Science ®Google Scholar
• Balas , E and Saltzman , MJ . 1991 . An Algorithm for the three-index assignment problem . Oper. Res. , 39 : 150 – 161 .
   Web of Science ®Google Scholar
• Colbourn , CJ . 1984 . The complexity of completing partial Latin squares . Discrete Appl. Math. , 8 : 25 – 30 .
   Web of Science ®Google Scholar
• De Loera , J and Onn , S . 2006 . All linear and integer programs are slim 3-way transportation programs . SIAM J. Opt. , 17 : 806 – 821 .
   Web of Science ®Google Scholar
• Dénes , J and Keedwell , AD . 1974 . Latin Squares and their Applications , New York : Academic Press .
   Google Scholar
• Euler , R . 2010 . On the completability of incomplete Latin squares . Euro. J. Combin. , 31 : 535 – 552 .
   Web of Science ®Google Scholar
• Euler , R , Burkard , RE and Grommes , R . 1986 . On Latin squares and the facial structure of related polytopes . Discrete Math. , 62 : 155 – 181 .
   Web of Science ®Google Scholar
• Euler , R and Le Verge , H . 1996 . Time-tables . polyhedra and the greedy algorithm, Discrete Appl. Math. , 65 : 207 – 221 .
   Web of Science ®Google Scholar
• Frieze , AM . 1983 . Complexity of a 3-dimensional assignment problem . Eur. J. Oper. Res. , 13 : 161 – 164 .
   Web of Science ®Google Scholar
• Funke , B , Grunert , T and Irnich , S . 2005 . Local search for the vehicle routing and scheduling problems: Review and conceptual integration . J. Heuristics , 11 : 267 – 306 .
   Web of Science ®Google Scholar
• Grötschel , M , Lovász , L and Schrijver , A . Geometric Algorithms and Combinatorial Optimization, 2nd corr. ed., Springer, Berlin, 1993
   Google Scholar
• CPLEX , ILOG . 11.2, http://ilog.com/products/cplex, 2009
   Google Scholar
• Leue , O . 1972 . Methoden zur Lösung 3-dimensionaler Zuordnungsprobleme . Angew. Inform. , 14 : 154 – 162 .
   Google Scholar
• Magos , D . 1996 . Tabu search for the planar three-index assignment problem . J. Global Opt. , 8 : 35 – 48 .
   Web of Science ®Google Scholar
• Magos , D and Miliotis , P . 1994 . An algorithm for the planar three-index assignment problem . Eur. J. Oper. Res. , 77 : 141 – 153 .
   Web of Science ®Google Scholar
• Nemhauser , GL and Wolsey , LA . 1988 . Integer and Combinatorial Optimization , New York : Wiley .
   Google Scholar
• Padberg , MW . 1973 . On the facial structure of set packing polyhedra . Math. Program. , 5 : 199 – 215 .
   Google Scholar
• Vlach , M . 1967 . Branch and bound method for the three-index assignment problem . Eco.-Mat. Obzor , 3 : 181 – 191 .
   Google Scholar