Registro:

Referencias:

• Aardal, K., Hipolito, A., Van Hoesel, C., Jansen, B., Roos, C., Terlaky, T., A branch-and-cut algorithm for the frequency assignment problem (1996) Research Memorandum 96/011, , Maastricht University
• Balas, E., Ceria, S., Cornuéjols, G., Pataki, G., Polyhedral methods for the maximum clique problem (1996) Cliques Coloring, and Satisfiability, 26, pp. 11-27. , DIMACS Series on Discrete Mathematics and Theoretical Computer Science. D. Johnson and M. Trick
• Brélaz, D., New methods to color the vertices of a graph (1979) Communications of the ACM, 22, pp. 251-256
• Christof, T., Loebel, A., Stoer, M., (1997) PORTA - A Polyhedron Representation Transformation Algorithm, Version 1.3
• De Werra, D., Heuristics for graph coloring (1990) Computing, (SUPPL. 7), pp. 191-208
• Glover, F., Parker, M., Ryan, J., Coloring by tabu branch and bound (1996) Cliques, Coloring, and Satisfiability, 26, pp. 285-308. , DIMACS Series on Discrete Mathematics and Theoretical Computer Science. D. Johnson and M. Trick
• Grotschel, M., Lovasz, L., Schrijver, A., (1988) Geometric Algorithms and Combinatorial Optimization, , Springer Berlin
• Herz, A., De Werra, D., Using tabu search techniques for graph coloring (1987) Computing, 39, pp. 345-351
• Johnson, D., The NP-completeness column: An ongoing guide (1985) Journal of Algorithms, 6, pp. 434-451
• Johnson, D., Trick, M., (1996) Cliques, Coloring, and Satisfiability, 26. , DIMACS Series on Discrete Mathematics and Theoretical Computer Science
• Karp, R., Reducibility among combinatorial problems (1972) Complexity of Computer Computations, pp. 85-104. , eds. R. Miller and J. Thatcher
• Kubale, M., Jackowski, B., A generalized implicit enumeration algorithm for graph coloring (1985) Communications of the ACM, 28 (4), pp. 412-418
• Mannino, C., Sassano, A., An exact algorithm for the maximum estable set problem (1994) Computational Optimization and Applications, 3, pp. 243-258
• Mehrotra, A., Trick, M., A column generation approach for graph coloring (1996) INFORMS Journal on Computing, 8 (4), pp. 344-353
• Nemhauser, G., Sigismondi, G., A strong cutting plane/branch-and-bound algorithm for node packing (1992) Journal of Operations Research Society, 43 (5), pp. 443-457
• Nemhauser, G., Wolsey, L., (1988) Integer and Combinatorial Optimization, , Wiley New York
• Padberg, M.W., On the facial structure of set packing polyhedral (1973) Mathematical Programming, 5, pp. 199-215
• Sager, T.J., Lin, S., A pruning procedure for exact graph coloring (1991) ORSA Journal on Computing, 3 (3), pp. 226-230
• Sassano, A., On the facial structure of the Set Covering Polytope (1989) Mathematical Programming, 44, pp. 181-202
• Sewell, E., An improved algorithm for exact graph coloring (1996) Cliques Coloring, and Satisfiability, 26, pp. 359-373. , DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Johnson and M. Trick
• Wolsey, L., (1998) Integer Programming, , Wiley New York

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------