메뉴 건너뛰기




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

Tutorial on surrogate constraint approaches for optimization in graphs

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;

EID: 0037803536     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023721723676     Document Type: Article
Times cited : (30)

References (44)
  • 2
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • Chvatal, V. (1979). "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research 4, 233-235.
    • (1979) Mathematics of Operations Research , vol.4 , pp. 233-235
    • Chvatal, V.1
  • 3
    • 34250258603 scopus 로고
    • Calculating surrogate constraints
    • Dyer, M. F. (1980), "Calculating Surrogate Constraints," Mathematical Programming 19, 255-278.
    • (1980) Mathematical Programming , vol.19 , pp. 255-278
    • Dyer, M.F.1
  • 4
    • 84878602368 scopus 로고    scopus 로고
    • A new genetic local search algorithm for graph coloring
    • Springer-Verlag
    • 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.
    • (1998) Lecture Notes in Computer Science 1498 , pp. 745-754
    • Dorne, R.1    Hao, J.K.2
  • 5
    • 0028510982 scopus 로고
    • A greedy randomized adaptive search procedure for maximum independent set
    • 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.
    • (1994) Operations Research , vol.42 , Issue.5 , pp. 860-878
    • Feo, T.A.1    Resende, M.G.C.2    Smith, S.H.3
  • 7
    • 4243618439 scopus 로고
    • An implicit enumeration code for the solution of the 0-1 bidimensional knapsack problem based on surrogate duality
    • Grimentz, Switzerland
    • 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.
    • (1992) Graphs and Optimization Colloquium
    • Fréville, A.1    Plateau, G.2
  • 8
    • 0027642396 scopus 로고
    • An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
    • 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.
    • (1993) European Journal of Operational Research , vol.68 , pp. 413-421
    • Fréville, A.1    Plateau, G.2
  • 9
    • 0001931981 scopus 로고
    • Stabulus: A technique for finding stable sets in large graphs with tabu search
    • 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.
    • (1989) Computing , vol.42 , pp. 35-44
    • Friden, C.1    Hertz, A.2    De Werra, D.3
  • 10
    • 0025541550 scopus 로고
    • Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
    • 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.
    • (1990) Computers & Operations Research , vol.155 , pp. 437-445
    • Friden, C.1    Hertz, A.2    De Werra, D.3
  • 11
    • 0000965650 scopus 로고    scopus 로고
    • Hybrid evolutionary algorithms for graph coloring
    • Galinier, P. and J.K. Hao. (1999). "Hybrid Evolutionary Algorithms for Graph Coloring," Journal of Combinatorial Optimization 3(4), 379-397.
    • (1999) Journal of Combinatorial Optimization , vol.3 , Issue.4 , pp. 379-397
    • Galinier, P.1    Hao, J.K.2
  • 12
    • 0021886787 scopus 로고
    • Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
    • Gavish, B. and H. Pirkul. (1985). "Efficient Algorithms for Solving Multiconstraint Zero-one Knapsack Problems to Optimality," Mathematical Programming 31, 78-105.
    • (1985) Mathematical Programming , vol.31 , pp. 78-105
    • Gavish, B.1    Pirkul, H.2
  • 14
    • 0000045626 scopus 로고
    • A multiphase-dual algorithm for the zero-one integer programming problems
    • Glover, F. (1965). "A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problems," Operations Research 13(6), 879-893.
    • (1965) Operations Research , vol.13 , Issue.6 , pp. 879-893
    • Glover, F.1
  • 15
    • 0001215807 scopus 로고
    • Surrogate constraints
    • Glover, F. (1968), "Surrogate Constraints," Operations Research 16(4), 741-749.
    • (1968) Operations Research , vol.16 , Issue.4 , pp. 741-749
    • Glover, F.1
  • 16
    • 0038580012 scopus 로고
    • Flows in arborescences
    • Glover, F. "Flows in Arborescences," Management Science 17(9), 568-586.
    • (1971) Management Science , vol.17 , Issue.9 , pp. 568-586
    • Glover, F.1
  • 17
    • 0016510894 scopus 로고
    • Surrogate constraint duality in mathematical programming
    • Glover, F. (1975). "Surrogate Constraint Duality in Mathematical Programming," Operations Research 23(3), 434-451.
    • (1975) Operations Research , vol.23 , Issue.3 , pp. 434-451
    • Glover, F.1
  • 18
    • 84989487658 scopus 로고
    • Heuristics for integer programming using surrogate constraints
    • Glover, F. (1977). "Heuristics for Integer Programming Using Surrogate Constraints," Decision Sciences 8(1), 156-166.
    • (1977) Decision Sciences , vol.8 , Issue.1 , pp. 156-166
    • Glover, F.1
  • 19
    • 43949148528 scopus 로고
    • Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
    • Glover, F. (1994). "Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)," Discrete Applied Mathematics 49, 231-255.
    • (1994) Discrete Applied Mathematics , vol.49 , pp. 231-255
    • Glover, F.1
  • 20
    • 34250086396 scopus 로고
    • Layering strategies for creating exploitable structure in linear and integer programs
    • Glover, F. and D. Klingman. (1988). "Layering Strategies for Creating Exploitable Structure in Linear and Integer Programs," Mathematical Programming 40(2), 165-182.
    • (1988) Mathematical Programming , vol.40 , Issue.2 , pp. 165-182
    • Glover, F.1    Klingman, D.2
  • 23
    • 0001422664 scopus 로고    scopus 로고
    • Critical event tabu search for multidimensional knapsack problems
    • J.H. Osman and J.P. Kelly (eds.); Kluwer Academic Publishers
    • 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.
    • (1996) Meta-Heuristics: Theory & Applications , pp. 407-427
    • Glover, F.1    Kochenberger, G.2
  • 24
    • 0031219862 scopus 로고    scopus 로고
    • Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
    • 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.
    • (1997) Computational Optimization and Applications , vol.8 , Issue.2 , pp. 151-172
    • Glover, F.1    Sherali, H.D.2    Lee, Y.3
  • 28
    • 0038241032 scopus 로고
    • 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
    • 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.
    • (1993)
    • Hanafi, S.1
  • 29
    • 0037903677 scopus 로고    scopus 로고
    • Résolution du Dual Composite du Sac à Dos Bidimensionnel en variables 0-1 par une méthode de Branch-and-Bound
    • 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.
    • (2001) Francoro III Conference, Quebec, Canada
    • Hanafi, S.1    Fréville, A.2
  • 31
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson, D.S. (1974). "Approximation Algorithms for Combinatorial Problems," Journal of Computer and System Sciences 9, 256-278.
    • (1974) Journal of Computer and System Sciences , vol.9 , pp. 256-278
    • Johnson, D.S.1
  • 33
    • 0031999161 scopus 로고    scopus 로고
    • An objective hyperplane procedure for solving the general all-integer linear programming (ILP) problem
    • 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.
    • (1998) European Journal of Operational Research , vol.104 , pp. 601-614
    • Joseph, A.1    Gass, S.2    Bryson, N.3
  • 34
    • 0038241145 scopus 로고
    • A study of alternative relaxation approaches for a manpower planning problem
    • Ijiri and Whinston (eds.); Academic Press, Inc., NY
    • 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.
    • (1979) Quantitative Planning and Control , pp. 141-164
    • Klingman, D.1    Karney, D.2
  • 37
    • 0037903672 scopus 로고    scopus 로고
    • Surrogate constraint analysis for improved multidimensional knapsack solutions
    • Osorio, M.A., F. Glover, and P. Hammer. (2002). "Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions," Discrete Applied Mathematics.
    • (2002) Discrete Applied Mathematics
    • Osorio, M.A.1    Glover, F.2    Hammer, P.3
  • 40
    • 34250429350 scopus 로고
    • On the facial structure of set packing polyhedra
    • Padberg, M.W. (1973). "On the Facial Structure of Set Packing Polyhedra," Mathematical Programming 5, 199-215.
    • (1973) Mathematical Programming , vol.5 , pp. 199-215
    • Padberg, M.W.1
  • 41
    • 0038579896 scopus 로고
    • The maximum clique problem
    • Pardalos, P. and J. Xue. (1994). "The Maximum Clique Problem," J. of Global Optimization 4(3), 286-301.
    • (1994) J. of Global Optimization , vol.4 , Issue.3 , pp. 286-301
    • Pardalos, P.1    Xue, J.2
  • 42
    • 0032266182 scopus 로고    scopus 로고
    • Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
    • 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.
    • (1998) ACM Transactions on Mathematical Software , vol.24 , pp. 386-394
    • Resende, M.G.C.1    Feo, T.A.2    Smith, S.H.3
  • 44
    • 0032373929 scopus 로고    scopus 로고
    • Min-max optimization of several classical discrete optimization problems
    • Yu, G. (1998). "Min-Max Optimization of Several Classical Discrete Optimization Problems," O Journal of Optimization Theory and Applications 98(1), 221-242.
    • (1998) O Journal of Optimization Theory and Applications , vol.98 , Issue.1 , pp. 221-242
    • Yu, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.