Tutorial on surrogate constraint approaches for optimization in graphs

Journal of Heuristics

Volumn 9, Issue 3, 2003, Pages 175-227

  Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Coloring; Covering; Independent sets; Mathematical relaxations; Maximum cliques; Surrogate constraints

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; SET THEORY;

COMBINATORIAL OPTIMIZATION; COVERING PROBLEMS; GRAPH COLORING; INDEPENDENT SETS; MATHEMATICAL RELAXATIONS; MAXIMUM CLIQUE PROBLEMS; SURROGATE CONSTRAINTS METHOD;

HEURISTIC METHODS;

EID: 0037803536     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023721723676     Document Type: Article

References (44)

1. Abello, J., P.M. Pardalos, and M.G.C. Resende. (1999). "On Maximum Clique Problems in Very Large Graphs." In J. Abello and J. Vitter (eds.), External Memory Algorithms and Visualization, DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society 50, 199-230.
2. Chvatal, V. (1979). "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research 4, 233-235.
3. Dyer, M. F. (1980), "Calculating Surrogate Constraints," Mathematical Programming 19, 255-278.
4. Dorne, R. and J.K. Hao. (1998). "A New Genetic Local Search Algorithm for Graph Coloring," Lecture Notes in Computer Science 1498. Springer-Verlag, pp. 745-754.
5. Feo, Thomas A., Mauricio G.C., Resende, and Stuart H. Smith. (1994), "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set," Operations Research 42(5), 860-878.
6. Fréville, A. and S. Hanafi. (2000). Des Bornes Duales Robustes pour le Sac à Dos Bidimensionnel en Variables 0-1. ROADF'2000. Nantes, France.
7. Fréville, A. and G. Plateau. (1992). "An Implicit Enumeration Code for the Solution of the 0-1 Bidimensional Knapsack Problem Based on Surrogate Duality," Graphs and Optimization Colloquium. Grimentz, Switzerland.
8. Fréville, A. and G. Plateau. (1993). "An Exact Search for the Solution of the Surrogate Dual of the 0-1 Bidimensional Knapsack Problem," European Journal of Operational Research 68, 413-421.
9. Friden, C., A. Hertz, and D. de Werra, (1989). "Stabulus: A Technique for Finding Stable Sets in Large Graphs with Tabu Search," Computing 42, 35-44.
10. Friden, C., A. Hertz and D. de Werra. (1990). "Tabaris: An Exact Algorithm Based on Tabu Search for Finding a Maximum Independent Set in a Graph," Computers & Operations Research 155, 437-445.
11. Galinier, P. and J.K. Hao. (1999). "Hybrid Evolutionary Algorithms for Graph Coloring," Journal of Combinatorial Optimization 3(4), 379-397.
12. Gavish, B. and H. Pirkul. (1985). "Efficient Algorithms for Solving Multiconstraint Zero-one Knapsack Problems to Optimality," Mathematical Programming 31, 78-105.
13. Gavish, B., F. Glover, and H. Pirkul, (1991). "Surrogate Constraints in Integer Programming," Journal of Information and Optimization Sciences 12(2), 219-228.
14. Glover, F. (1965). "A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problems," Operations Research 13(6), 879-893.
15. Glover, F. (1968), "Surrogate Constraints," Operations Research 16(4), 741-749.
16. Glover, F. "Flows in Arborescences," Management Science 17(9), 568-586.
17. Glover, F. (1975). "Surrogate Constraint Duality in Mathematical Programming," Operations Research 23(3), 434-451.
18. Glover, F. (1977). "Heuristics for Integer Programming Using Surrogate Constraints," Decision Sciences 8(1), 156-166.
19. Glover, F. (1994). "Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)," Discrete Applied Mathematics 49, 231-255.
20. Glover, F. and D. Klingman. (1988). "Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs," Mathematical Programming 40(2), 165-182.
21. Glover, F. and M. Laguna. (1993). "Tabu Search." In C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publishing, pp. 71-140.
22. Glover, F. and M. Laguna. (1977). Tabu Search. Kluwer Academic Publishers.
23. Glover, F. and G. Kochenberger. (1996). "Critical Event Tabu Search for Multidimensional Knapsack Problems." J.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory & Applications. Kluwer Academic Publishers, pp. 407-427.
24. Glover, F., H.D. Sherali, and Y. Lee. (1997). "Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming," Computational Optimization and Applications 8(2), 151-172.
25. Glover, F. (2000). "Multi-Start and Strategic Oscillation Methods-Principles to Exploit Adaptive Memory." M. Laguna and J.L. Gonzales Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, pp. 1-24.
26. Greenberg, H.J. and W.P. Pierskalla. (1970). "Surrogate Mathematical Programs," Operations Research 18, 924-939.
27. Greenberg, H.J. and W.P. Pierskalla. (1973). "Quasi-Conjugate Functions and Surrogate Duality." Cahiers due Centre d'Etudes de Recherche Operationelle 15, 437-448.
28. Hanafi S. (1993). "Contribution à la Résolution de Problèmes Duaux de Grande Taille en Optimisation Combinatoire," Ph.D. thesis, Université de Valenciennes et du Hainaut-Cambrésis, France.
29. Hanafi, S. and A. Fréville. (2001). "Résolution du Dual Composite du Sac à Dos Bidimensionnel en variables 0-1 par une méthode de Branch-and-Bound," Francoro III Conference, Quebec, Canada.
30. Homer, S. and M. Peinado. (1996). "Experiments with Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs," DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, 147-155.
31. Johnson, D.S. (1974). "Approximation Algorithms for Combinatorial Problems," Journal of Computer and System Sciences 9, 256-278.
32. Johnson, D.S. and M.A. Trick. (eds.) (1996). Clique, Coloring and Satisfiability, Second Implementation Challenge. DIMACS, AMS.
33. Joseph, A., S. Gass and N. Bryson. (1998). "An Objective Hyperplane Procedure for Solving the General All-Integer Linear Programming (ILP) Problem," European Journal of Operational Research 104, 601-614.
34. Klingman, D. and D. Karney. (1979). "A Study of Alternative Relaxation Approaches for a Manpower Planning Problem." Ijiri and Whinston (eds.), Quantitative Planning and Control. Academic Press, Inc., NY, pp. 141-164.
35. Kochenberger, G.A., B.A. McCarl, and F.P. Wyman. (1974). "A Heuristic for General Integer Programming," Decision Sciences 5(1), 36-44.
36. LØkketangen, A. and F. Glover. (1997). "Surrogate Constraint Analysis-New Heuristics and Learning Schemes for Satisfiability Problems," DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, 537-572.
37. Osorio, M.A., F. Glover, and P. Hammer. (2002). "Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions," Discrete Applied Mathematics.
38. Ouyang, M., M. Toulouse, K. Thulasiraman, F. Glover, and J.S. Deogun. (2000a). "Multilevel Cooperative Search for the Circuit/Hypergraph Partitioning Problem," IEEE Transactions on Computer-Aided Design.
39. Ouyang, M., M. Toulouse, K. Thulasiraman, F. Glover, and J.S. Deogun. (2000b). "Multi-Level Cooperative Search: Application to the Netlist/Hypergraph Partitioning Problem," International Symposium on Physical Design. ACM Press, pp. 192-198.
40. Padberg, M.W. (1973). "On the Facial Structure of Set Packing Polyhedra," Mathematical Programming 5, 199-215.
41. Pardalos, P. and J. Xue. (1994). "The Maximum Clique Problem," J. of Global Optimization 4(3), 286-301.
42. Resende, M.G.C., T.A. Feo, and S.H. Smith. (1998) "Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP," ACM Transactions on Mathematical Software 24, 386-394.
43. Toulouse, M., K. Thulasiram, and F. Glover. (1999). "Multi-Level Cooperative Search," Lecture Notes in Computer Science, Vol. 1685, Springer-Verlag, pp. 533-542.
44. Yu, G. (1998). "Min-Max Optimization of Several Classical Discrete Optimization Problems," O Journal of Optimization Theory and Applications 98(1), 221-242.