메뉴 건너뛰기




Volumn 124, Issue 1-2, 2000, Pages 341-360

Combinatorial optimization: Current successes and directions for the future

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; HEURISTIC METHODS; HIGH LEVEL LANGUAGES; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PERSONAL COMPUTERS;

EID: 0034538651     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00430-1     Document Type: Article
Times cited : (47)

References (38)
  • 2
    • 85119555607 scopus 로고    scopus 로고
    • D. Applegate, R. Bixby, W. Cook, Finding cuts in the traveling salesman problem, Rice University Technical Report, 1996.
  • 3
    • 85119551384 scopus 로고    scopus 로고
    • E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Appl. Math. 89 (1998) 3–44; orginally appeared as a Management Science Research Report 348, GSIA, Carnegie Mellon University, 1974.
  • 4
    • 85119556310 scopus 로고    scopus 로고
    • E. Balas, G. Cornuejols, N. Natraj, Gomory cuts revisited, Operations Res. Lett. 19 (1996) 1–9.
  • 5
    • 0002031108 scopus 로고
    • Pivot and complement: A heuristic for 0–1 programming
    • E. Balas R.K. Martin Pivot and complement: A heuristic for 0–1 programming Management Sci. 26 1980 86 96
    • (1980) Management Sci. , vol.26 , pp. 86-96
    • Balas, E.1    Martin, R.K.2
  • 7
    • 85119549369 scopus 로고    scopus 로고
    • J.R. Birge Introduction to Stochastic Programming 1997 Springer Berlin
    • (1997)
    • Birge, J.R.1
  • 8
    • 85119557646 scopus 로고    scopus 로고
    • J. Bisschop, R. Entriken AIMMS The modeling system. Paragon Decision Technology, 1993.
  • 9
    • 0031095990 scopus 로고    scopus 로고
    • On the effectiveness of set covering formulations for the vehicle routing probelm with time windows
    • J. Bramel D. Simchi-Levi On the effectiveness of set covering formulations for the vehicle routing probelm with time windows Operations Res. 45 1997 295 301
    • (1997) Operations Res. , vol.45 , pp. 295-301
    • Bramel, J.1    Simchi-Levi, D.2
  • 10
    • 0016472959 scopus 로고
    • Analysis of mathematical programming problems prior to applying the simplex method
    • A.L. Brearly G. Mitra H.P. Williams Analysis of mathematical programming problems prior to applying the simplex method Math. Programming 8 1975 54 83
    • (1975) Math. Programming , vol.8 , pp. 54-83
    • Brearly, A.L.1    Mitra, G.2    Williams, H.P.3
  • 12
    • 0042860609 scopus 로고
    • Large-scale 0–1 programming on distributed workstations
    • T. Cannon K.L. Hoffman Large-scale 0–1 programming on distributed workstations Ann. Oper. Res. 22 1990 181 217
    • (1990) Ann. Oper. Res. , vol.22 , pp. 181-217
    • Cannon, T.1    Hoffman, K.L.2
  • 13
    • 85119563371 scopus 로고    scopus 로고
    • CPLEX Optimization, Inc. (1998) Using the CPLEX Callable Library and CPLEX Mixed Integer Programming Library, Version 5.0.
  • 14
    • 0039491195 scopus 로고    scopus 로고
    • Optimization case studies in the NEOS Guide
    • J. Czyzyk T. Wisniewski S. Wright Optimization case studies in the NEOS Guide SIAM Rev. 41 1999 148 163
    • (1999) SIAM Rev. , vol.41 , pp. 148-163
    • Czyzyk, J.1    Wisniewski, T.2    Wright, S.3
  • 15
    • 85119557919 scopus 로고    scopus 로고
    • Dash Associates, XPRESS-MP User's Manual, 1994.
  • 16
    • 85119557031 scopus 로고
    • R. Fourer D.M. Gay B.W. Kernighan AMPL A Modeling Language for Mathematical programming 1993 The Scientific Press, Palo Alto, CA
    • (1993)
    • Fourer, R.1    Gay, D.M.2    Kernighan, B.W.3
  • 17
    • 85119549471 scopus 로고    scopus 로고
    • F. Glover, M. Laguna, Tabu Search, Kluwer Academic, Boston, 1997.
  • 18
    • 85119559397 scopus 로고    scopus 로고
    • R. Gomory, Solving linear programming problems in integers, R.E. Bellman and M. Hall Jr. (Eds.), Combinatorial Analysis, American Mathematical Society, Providence, RI, pp. 211–216.
  • 19
    • 85033756730 scopus 로고    scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming
    • M.X. Goemans D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming J. ACM 42 6 1996 1113 1145
    • (1996) J. ACM , vol.42 , Issue.6 , pp. 1113-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 20
    • 85119554606 scopus 로고
    • D.E. Goldberg Genetic Algorithms in Search Algorithms and Machine Learning 1989 Addison-Wesley Reading, MA
    • (1989)
    • Goldberg, D.E.1
  • 21
    • 85119562978 scopus 로고
    • H.J. Greenberg A computer Assisted Anaysis System for Mathematical Programming Models and Solutions: A User's Guide to Analyze 1993 Kluwer Hingham, MA
    • (1993)
    • Greenberg, H.J.1
  • 22
    • 0003180963 scopus 로고    scopus 로고
    • An annotated bibiliography for post-solution analyis in mixed integer and combinatorial optimization
    • H.J. Greenberg An annotated bibiliography for post-solution analyis in mixed integer and combinatorial optimization D.L. Woodruff Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search 1998 Kluwer Hingham, MA
    • (1998)
    • Greenberg, H.J.1
  • 23
    • 0007993386 scopus 로고    scopus 로고
    • Analyzing infeasible mixed integer and integer linear programs
    • O. Guieu J. Chinneck Analyzing infeasible mixed integer and integer linear programs INFORMS J. Comput. 11 1999 63 77
    • (1999) INFORMS J. Comput. , vol.11 , pp. 63-77
    • Guieu, O.1    Chinneck, J.2
  • 24
    • 85119562516 scopus 로고
    • P. Hansen The steepest ascent mildest descent heuristic for combinatorial programming, Proceedings of Congress on Numerical Methods in Combinatorial Optimization 1986 Capri Italy
    • (1986)
    • Hansen, P.1
  • 25
    • 0026125207 scopus 로고
    • Improving the LP-representation of zero-one linear programs for branch-and-cut
    • K.L. Hoffman M. Padberg Improving the LP-representation of zero-one linear programs for branch-and-cut ORSA J. Comput. 3 1991 121 134
    • (1991) ORSA J. Comput. , vol.3 , pp. 121-134
    • Hoffman, K.L.1    Padberg, M.2
  • 26
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of search strategies for mixed integer programming
    • J.T. Linderoth M.W. Savelsbergh A computational study of search strategies for mixed integer programming INFORMS J. Comput. 11 1998 173 187
    • (1998) INFORMS J. Comput. , vol.11 , pp. 173-187
    • Linderoth, J.T.1    Savelsbergh, M.W.2
  • 27
    • 85119564747 scopus 로고    scopus 로고
    • R.K. Martin, Large Scale Linear and Integer Optimization, Kluwer, Hingham, MA, 1998.
  • 28
    • 85119553528 scopus 로고    scopus 로고
    • K. McAloon C. Tretkoff Optimization and Computational Logic, Wiley Interscience Series in Mathematics and Optimization 1996 Wiley New York
    • (1996)
    • McAloon, K.1    Tretkoff, C.2
  • 29
    • 0000114960 scopus 로고
    • Stochastic network programming for financial planning models
    • J. Mulvey H. Vladimirou Stochastic network programming for financial planning models Management Sci. 38 1992 1642 1664
    • (1992) Management Sci. , vol.38 , pp. 1642-1664
    • Mulvey, J.1    Vladimirou, H.2
  • 32
    • 85119549956 scopus 로고
    • M. Padberg Linear Optimization and Extensions 1995 Springer Heidelberg
    • (1995)
    • Padberg, M.1
  • 33
    • 0002500749 scopus 로고
    • A hierarchy of relaxation and convex hull characterizations for mixed-integer zero-one programming problems
    • H.D. Sherali W.P. Adams A hierarchy of relaxation and convex hull characterizations for mixed-integer zero-one programming problems Discrete Appl. Math. 52 1994 83 106
    • (1994) Discrete Appl. Math. , vol.52 , pp. 83-106
    • Sherali, H.D.1    Adams, W.P.2
  • 34
    • 85119560464 scopus 로고    scopus 로고
    • B. Shetty, H. Bhargava, R. Krishnan (Eds.), Annals of Operations Research 38 (1992) Volume on “Model Management in Operations Research”.
  • 35
    • 85119552021 scopus 로고    scopus 로고
    • M. Sol, Column generation techniques for pickup and delivery problems, Dissertation, Eindhoven University of Technology, Eindhoven, The Netherlands, 8 November, 1994.
  • 36
    • 85119561135 scopus 로고    scopus 로고
    • P. Van Hentenryck The OPL Optimization Programming Language 1999 MIT Press Cambridge, MA
    • (1999)
    • Van Hentenryck, P.1
  • 37
    • 85119557556 scopus 로고    scopus 로고
    • H.P. Williams Model Building in Mathematical Programming 4th ed. 1998 Wiley New York
    • (1998)
    • Williams, H.P.1
  • 38
    • 85119558037 scopus 로고    scopus 로고
    • L.A. Wolsey Integer Programming 1998 Wiley New York
    • (1998)
    • Wolsey, L.A.1


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