메뉴 건너뛰기




Volumn 4, Issue 1, 2007, Pages 77-86

Improving the feasibility pump

Author keywords

Feasibility pump; Mixed integer programming; Primal heuristics

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 33846624302     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.10.004     Document Type: Article
Times cited : (127)

References (19)
  • 1
    • 33846634734 scopus 로고    scopus 로고
    • T. Achterberg, T. Koch, A. Martin, The mixed integer programming library: Miplib 2003. http://miplib.zib.de
  • 4
    • 0002031108 scopus 로고
    • Pivot-and-complement: A heuristic for 0-1 programming
    • Balas E., and Martin C.H. Pivot-and-complement: A heuristic for 0-1 programming. Management Science 26 1 (1980) 86-96
    • (1980) Management Science , vol.26 , Issue.1 , pp. 86-96
    • Balas, E.1    Martin, C.H.2
  • 5
    • 13944265305 scopus 로고    scopus 로고
    • Pivot and shift-a mixed integer programming heuristic
    • Balas E., Schmieta S., and Wallace C. Pivot and shift-a mixed integer programming heuristic. Discrete Optimization 1 1 (2004) 3-12
    • (2004) Discrete Optimization , vol.1 , Issue.1 , pp. 3-12
    • Balas, E.1    Schmieta, S.2    Wallace, C.3
  • 6
    • 33846641313 scopus 로고    scopus 로고
    • L. Bertacco, M. Fischetti, A. Lodi, A feasibility pump heuristic for general mixed-integer problems, Technical Report OR/05/5, DEIS-Università di Bologna, Italy, May 2005
  • 7
    • 12344255882 scopus 로고    scopus 로고
    • Exploring relaxation induced neighborhoods to improve MIP solutions
    • Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102 1 (2005) 71-90
    • (2005) Mathematical Programming , vol.102 , Issue.1 , pp. 71-90
    • Danna, E.1    Rothberg, E.2    Le Pape, C.3
  • 10
    • 0031097090 scopus 로고    scopus 로고
    • General purpose heuristics for integer programming - part I
    • Glover F., and Laguna M. General purpose heuristics for integer programming - part I. Journal of Heuristics 3 (1997)
    • (1997) Journal of Heuristics , vol.3
    • Glover, F.1    Laguna, M.2
  • 11
    • 0031539254 scopus 로고    scopus 로고
    • General purpose heuristics for integer programming - part II
    • Glover F., and Laguna M. General purpose heuristics for integer programming - part II. Journal of Heuristics 3 (1997)
    • (1997) Journal of Heuristics , vol.3
    • Glover, F.1    Laguna, M.2
  • 12
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publisher, Boston, Dordrecht, London
    • Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publisher, Boston, Dordrecht, London
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 14
    • 0014536423 scopus 로고
    • Efficient heuristic procedures for integer linear programming with an interior
    • Hillier F.S. Efficient heuristic procedures for integer linear programming with an interior. Operations Research 17 (1969) 600-637
    • (1969) Operations Research , vol.17 , pp. 600-637
    • Hillier, F.S.1
  • 15
    • 33846633802 scopus 로고    scopus 로고
    • ILOG, Cplex. http://www.ilog.com/products/cplex
  • 16
    • 0032050092 scopus 로고    scopus 로고
    • Solving zero/one mixed integer programming problems using tabu search
    • Løkketangen A., and Glover F. Solving zero/one mixed integer programming problems using tabu search. European Journal of Operations Research 106 (1998) 624-658
    • (1998) European Journal of Operations Research , vol.106 , pp. 624-658
    • Løkketangen, A.1    Glover, F.2
  • 17
    • 33846628651 scopus 로고    scopus 로고
    • H. Mittelmann, Decision tree for optimization software: Benchmarks for optimization software. http://plato.asu.edu/bench.html, 2003
  • 18
    • 33846566395 scopus 로고    scopus 로고
    • M. Nediak, J. Eckstein, Pivot, cut, and dive: A heuristic for 0-1 mixed integer programming, Technical Report RRR 53-2001, Rutgers University, 2001
  • 19
    • 0002585787 scopus 로고
    • A heuristic ceiling point algorithm for general integer linear programming
    • Saltzman R.M., and Hillier F.S. A heuristic ceiling point algorithm for general integer linear programming. Management Science 38 2 (1992) 263-283
    • (1992) Management Science , vol.38 , Issue.2 , pp. 263-283
    • Saltzman, R.M.1    Hillier, F.S.2


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