Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques

Discrete Optimization - Tập 6 - Trang 64-78 - 2009
Javier Marenco1,2, Annegret Wagler2
1Computer Science Dept., FCEN, University of Buenos Aires Pabellón I, Ciudad Universitaria, (1428) Buenos Aires, Argentina
2Sciences Institute, National University of General Sarmiento, J. M. Gutiérrez y J. Verdi, Malvinas Argentinas, (1613) Buenos Aires, Argentina

Tài liệu tham khảo

A. Bley, A. Eisenblätter, M. Grötschel, A. Wagler, R. Wessäly, Frequenzplanung für Punkt- zu Mehrpunkt-Funksysteme, Abschlußbericht eines Projekts der BOSCH Telecom GmbH und des Konrad-Zuse-Zentrums für Informationstechnik Berlin, 1999 R. Borndörfer, A. Eisenblätter, M. Grötschel, A. Martin, The orientation model for frequency assignment problems, ZIB Technical Report TR 98-01, 1998 de Werra, 1994, Chromatic scheduling and frequency assignment, Discrete Applied Mathematics, 49, 165, 10.1016/0166-218X(94)90207-0 de Werra, 1988, Consecutive colorings of graphs, ZOR, 32, 1 A. Gerhardt, Polyedrische Untersuchungen von Zwei-Maschinen-Scheduling-Problemen mit Antiparallelitätsbedingungen, Master Thesis, Technische Universität Berlin, 1999 J. Marenco, Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems, Ph.D. Thesis, Universidad de Buenos Aires, Argentina, 2005 Marenco, 2006, On the combinatorial structure of chromatic scheduling polytopes, Discrete Applied Mathematics, 154–13, 1865, 10.1016/j.dam.2006.03.032 Marenco, 2007, Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems, Annals of Operations Research, 150-1, 159, 10.1007/s10479-006-0156-y