메뉴 건너뛰기




Volumn 33, Issue 1, 2005, Pages 42-54

Branching rules revisited

Author keywords

Branch and bound; Mixed integer programming; Pseudocost branching; Reliability branching; Strong branching; Variable selection

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

EID: 4544306036     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.002     Document Type: Article
Times cited : (379)

References (15)
  • 5
    • 0343649098 scopus 로고
    • Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem
    • L.A. Wolsey, G. Rinaldi (Eds.)
    • J.M. Clochard, D. Naddef, Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem, in: L.A. Wolsey, G. Rinaldi (Eds.), Proceedings on the Third IPCO Conference, 1993, pp. 291-311.
    • (1993) Proceedings on the Third IPCO Conference , pp. 291-311
    • Clochard, J.M.1    Naddef, D.2
  • 6
    • 4544386107 scopus 로고    scopus 로고
    • 2003 Software survey: Linear programming
    • Fourer B. 2003 Software survey. linear programming OR/MS Today. 30(6):2003;34-43.
    • (2003) OR/MS Today , vol.30 , Issue.6 , pp. 34-43
    • Fourer, B.1
  • 7
    • 0004141533 scopus 로고    scopus 로고
    • ILOG CPLEX. Reference Manual, 2003. http://www.ilog.com/products/cplex.
    • (2003) Reference Manual
  • 8
    • 77957093543 scopus 로고
    • Computer codes for problems of integer programming
    • Land A., Powell S. Computer codes for problems of integer programming. Ann. Discrete Math. 5:1979;221-269.
    • (1979) Ann. Discrete Math. , vol.5 , pp. 221-269
    • Land, A.1    Powell, S.2
  • 10
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of search strategies for mixed integer programming
    • Linderoth J.T., Savelsbergh M.W.P. A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11:1999;173-187.
    • (1999) INFORMS J. Comput. , vol.11 , pp. 173-187
    • Linderoth, J.T.1    Savelsbergh, M.W.P.2
  • 11
    • 4544315902 scopus 로고    scopus 로고
    • LINDO. API Users Manual, 2003. http://www.lindo.com.
    • (2003) API Users Manual
  • 13
    • 0042124545 scopus 로고
    • Investigations of some branch and bound strategies for the solution of mixed integer linear programs
    • Mitra G. Investigations of some branch and bound strategies for the solution of mixed integer linear programs. Math. Programming. 4:1973;155-170.
    • (1973) Math. Programming , vol.4 , pp. 155-170
    • Mitra, G.1
  • 15
    • 4344639338 scopus 로고    scopus 로고
    • Polyhedral theory and branch-and-cut algorithms for the symmetric TSP
    • G. Gutin, & A. Punnen. Dordrecht: Kluwer
    • Naddef D. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. Gutin G., Punnen A. The Traveling Salesman Problem and its Variations. 2002;Kluwer, Dordrecht.
    • (2002) The Traveling Salesman Problem and Its Variations
    • Naddef, D.1


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