메뉴 건너뛰기
TOP
Volumn 17, Issue 1, 2009, Pages 158-170
Applying mod-k-cuts for solving linear ordering problems
Author keywords

Branch and cut; Linear ordering problem; Mod k cuts
Indexed keywords

EID: 67349099459     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/s11750-009-0096-1     Document Type: Conference Paper
Times cited : (6)
References (16)
  • 1
    • 44649140605 scopus 로고    scopus 로고
    • Embedding {0,1/2}-cuts in a branch and cut framework: A computational study
    • Andrello A, Caprara A, Fischetti M (2007) Embedding {0,1/2}-cuts in a branch and cut framework: A computational study. Inf J Comput 19(2):229-238
    • (2007) Inf J Comput , vol.19 , Issue.2 , pp. 229-238
    • Andrello, A.1    Caprara, A.2    Fischetti, M.3
  • 3
    • 0001340651 scopus 로고    scopus 로고
    • {0,1/2}-Chvátal-Gomory cuts
    • Caprara A, Fischetti M (1996) {0,1/2}-Chvátal-Gomory cuts. Math Program 74:221-235
    • (1996) Math Program , vol.74 , pp. 221-235
    • Caprara, A.1    Fischetti, M.2
  • 4
    • 0002910993 scopus 로고    scopus 로고
    • On the separation of maximally violated mod- k cuts
    • Caprara A, Fischetti M, Letchford AN (2000) On the separation of maximally violated mod- k cuts. Math Program 87:37-56
    • (2000) Math Program , vol.87 , pp. 37-56
    • Caprara, A.1    Fischetti, M.2    Letchford, A.N.3
  • 5
    • 33747175939 scopus 로고    scopus 로고
    • Facets of the linear ordering polytope: A unification for the fence family through weighted graphs
    • Doignon J-P, Fiorini S, Joret G (2006) Facets of the linear ordering polytope: A unification for the fence family through weighted graphs. J Math Psychol 50:251-262
    • (2006) J Math Psychol , vol.50 , pp. 251-262
    • Doignon, J.-P.1    Fiorini, S.2    Joret, G.3
  • 6
    • 0035885331 scopus 로고    scopus 로고
    • Determining the automorphism group of the linear ordering polytope
    • Fiorini S (2001) Determining the automorphism group of the linear ordering polytope. Discrete Appl Math 112:121-128
    • (2001) Discrete Appl Math , vol.112 , pp. 121-128
    • Fiorini, S.1
  • 7
    • 67349094204 scopus 로고    scopus 로고
    • Maximally violated mod- k cuts: A general purpose separation routine and its application to the linear ordering problem
    • Diploma thesis, University of Heidelberg
    • Fricke L (2007) Maximally violated mod- k cuts: A general purpose separation routine and its application to the linear ordering problem. Diploma thesis, University of Heidelberg
    • (2007)
    • Fricke, L.1
  • 8
    • 0021521702 scopus 로고
    • A cutting plane algorithm for the linear ordering problem
    • Grötschel M, Jünger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 32:1195-1220
    • (1984) Oper Res , vol.32 , pp. 1195-1220
    • Grötschel, M.1    Jünger, M.2    Reinelt, G.3
  • 10
    • 67349105240 scopus 로고    scopus 로고
    • Ilog Cplex (2009) http://www.ilog.com/products/cplex
    • (2009)
  • 11
    • 0342571667 scopus 로고    scopus 로고
    • The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
    • Jünger M, Thienel S (2000) The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30:1325-1352. http://www.informatik.uni-koeln.de/abacus
    • (2000) Softw Pract Exp , vol.30 , pp. 1325-1352
    • Jünger, M.1    Thienel, S.2
  • 12
    • 38149147249 scopus 로고
    • More facets from fences for linear ordering and acyclic subgraph polytopes
    • Leung J, Lee J (1994) More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl Math 50:185-200
    • (1994) Discrete Appl Math , vol.50 , pp. 185-200
    • Leung, J.1    Lee, J.2
  • 13
    • 67349102974 scopus 로고    scopus 로고
    • A library of linear ordering benchmark instances
    • LOLIB (2008) A library of linear ordering benchmark instances. http://www.informatik.uni-heidelberg.de/groups/comopt/software/LOLIB
    • (2008)
  • 14
    • 0346305540 scopus 로고
    • Binary stochastic choice
    • In: Chipman J, McFadden D, Richter M (eds) Westview Press, Boulder
    • McLennan A (1990) Binary stochastic choice. In: Chipman J, McFadden D, Richter M (eds) Preferences, uncertainty and rationality. Westview Press, Boulder, pp 187-202
    • (1990) Preferences, Uncertainty and Rationality , pp. 187-202
    • McLennan, A.1
  • 15
    • 0342746850 scopus 로고
    • The linear ordering problem: Algorithms and applications
    • Heldermann
    • Reinelt G (1985) The linear ordering problem: Algorithms and applications. Research and exposition in mathematics, vol 8. Heldermann
    • (1985) Research and Exposition in Mathematics , vol.8
    • Reinelt, G.1
  • 16
    • 51249162633 scopus 로고
    • A note on small linear ordering polytopes
    • Reinelt G (1995) A note on small linear ordering polytopes. Discrete Comput Geom 10:67-78
    • (1995) Discrete Comput Geom , vol.10 , pp. 67-78
    • Reinelt, G.1

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