A branch-and-price approach for graph multi-coloring

Operations Research/ Computer Science Interfaces Series

Volumn 37, Issue , 2007, Pages 15-29

  Mehrotra, Anuj ^a   Trick, Michael A ^b  

^a UNIVERSITY OF MIAMI   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Coloring; Column generation; Integer programming; Multi coloring

Indexed keywords

EID: 74849097043     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-48793-9_2     Document Type: Article

References (19)

1. Aardal, K. I., S. P. M. Van Hoesel, A. M. C. A. Koster, C. Manino, and A. Sassano. (2001). Models and Solution Techniques for Frequency Assignment Problems 40R1: 4, 261-317.
2. Balas, E. and H. Samuelsson. (1977). A node covering algorithm, Naval Research Logistics Quarterly 24: 2, 213-233.
3. Balas, E. and J. Xue. (1991). Minimum weighted coloring of triangulated graphs, with apphcation to maximum weight vertex packing and clique finding in arbitrary graphs, SI AM Journal on Computing 20: 2, 209-221.
4. Balas, E. and C. S. Yu. (1986). Finding a maximum chque in an arbitrary graph, SIAM Journal on Computing 15: 4, 1054-1068.
5. Barnhart, C, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. (1998). Branch-and-Price: Column Generation for Huge Integer Programs, Operations Research 46-'3, 316-329.
6. Carraghan, C. and P. M. Pardalos. (1990). An exact algorithm for the maximum clique problem, Operations Research Letters 9, 375-382.
7. Coffman Jr., E. G., M. R. Garey, D. S. Johnson, and A. S. Lapaugh. (1985). Scheduling File Transfers SIAM Journal on Computing 14: 4 743-780.
8. Jerrum, M. (1992). Large chques elude the metropolis process. Random Structures and Algorithms 3: 4, 347-360.
9. Johnson, D. S. A. Mehrotra, and M. A. Trick. (2002). Computational Challenge on Graph Coloring and its Generalizations International Symposium on Mathematical Programming, Copenhagen, Denmark.
10. Johnson, E. L. (1989). Modeling and strong linear programs for mixed integer programming. Algorithms and Model Formulations in Mathematical Programming, NATO ASI 51, S. W. Wallace (ed.), Springier-Verlag Berlin, Heidelberg, 1-43.
11. Khoury, B. N. and P. M. Pardalos. (1996). An algorithm for finding the maximum clique on an arbitrary graph, Second DIM ACS Challenge: Cliques, Coloring, and Satisfiability, DIM ACS Series on Discrete Mathematics and Theoritical Computer Science, D. S. Johnson and M. A. Trick (eds.), American Mathematical Society, Providence.
12. Mehrotra, A. and M. A. Trick. (1996). A column generation approach for exact graph coloring, INFORMS Journal on Computing, 8: 4, 133-151.
13. Mehrotra, A. and M. A. Trick. (1998). Chques and Clustering: A Combinatorial Approach, Operations Research Letters, 22: 1, 1-12.
14. Narayanan, L. (2002). Channel Assignment and Graph Multi-coloring, in Handhook of Wireless Networks and Mobile Computing, Wiley.
15. Nemhauser, G. L. and L. E. Trotter. (1975). Vertex packings: Structural properties and algorithms. Mathematical Programming 8, 232-248.
16. Pittel, B. (1982). On the probable behaviour of some algorithms for finding the stability number of a graph. Mathematical Proceedings of the Cambridge Philosophical Society 92, 511-526.
17. Prestwich, S. (2006). Generahzed Graph Coloring by a Hybrid of Local Search and Constraint Programming, Discrete Applied Mathematics, to appear.
18. Ryan, D. M. and B. A. Foster. (1981). An integer programming approach to scheduling, in Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, North-Holland, Amsterdam, 269-280.
19. Vanderbeck, F. (2005). Branching in Branch-and-Price: A Generic Scheme, manuscript, Apphed Mathematics, University Bordeaux 1, F-33405 Talence Cedex, France.