메뉴 건너뛰기
Mathematical Programming
Volumn 132, Issue 1-2, 2012, Pages 79-98
N-step mingling inequalities: New facets for the mixed-integer knapsack set
Author keywords

Facet; Mingling; Mixed integer programming; Mixed integer rounding; Valid inequality
Indexed keywords

FACET; MINGLING; MIXED INTEGER PROGRAMMING; MIXED-INTEGER ROUNDING; VALID INEQUALITY;
EID: 84858439764     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0382-6     Document Type: Article
Times cited : (12)
References (16)
  • 1
    • 3042514606 scopus 로고    scopus 로고
    • On the facets of the mixed-integer knapsack polyhedron
    • 2019371 10.1007/s10107-003-0400-z
    • A. Atamtürk 2003 On the facets of the mixed-integer knapsack polyhedron Math. Program. 98 145 175 2019371 10.1007/s10107-003-0400-z
    • (2003) Math. Program. , vol.98 , pp. 145-175
    • Atamtürk, A.1
  • 2
    • 10844248146 scopus 로고    scopus 로고
    • Sequence independent lifting for mixed-integer programming
    • DOI 10.1287/opre.1030.0099
    • A. Atamtürk 2004 Sequence independent lifting for mixed-integer programming Oper. Res. 52 487 490 2066040 10.1287/opre.1030.0099 (Pubitemid 40000797)
    • (2004) Operations Research , vol.52 , Issue.3 , pp. 487-490
    • Atamturk, A.1
  • 3
    • 25444445790 scopus 로고    scopus 로고
    • Cover and pack inequalities for (mixed) integer programming
    • DOI 10.1007/s10479-005-3442-1
    • A. Atamtürk 2005 Cover and pack inequalities for (mixed) integer programming Ann. Oper. Res. 139 21 38 2175629 10.1007/s10479-005-3442-1 (Pubitemid 41361093)
    • (2005) Annals of Operations Research , vol.139 , Issue.1 , pp. 21-38
    • Atamturk, A.1
  • 4
    • 77949541701 scopus 로고    scopus 로고
    • Mingling: Mixed-integer rounding with bounds
    • 2595915 10.1007/s10107-009-0265-x
    • A. Atamtürk O. Günlük 2010 Mingling: mixed-integer rounding with bounds Math. Program. 123 315 338 2595915 10.1007/s10107-009-0265- x
    • (2010) Math. Program. , vol.123 , pp. 315-338
    • Atamtürk, A.1    Günlük, O.2
  • 5
    • 28244439056 scopus 로고    scopus 로고
    • Valid inequalities based on simple mixed-integer sets
    • DOI 10.1007/s10107-005-0599-y
    • S. Dash O. Günlük 2006 Valid inequalities based on simple mixed-integer sets Math. Program. 105 29 53 2185927 10.1007/s10107-005-0599-y (Pubitemid 41705517)
    • (2006) Mathematical Programming , vol.105 , Issue.1 , pp. 29-53
    • Dash, S.1    Gunluk, O.2
  • 6
    • 0014593589 scopus 로고
    • Some polyhedra related to combinatorial problems
    • 256718 10.1016/0024-3795(69)90017-2
    • R.E. Gomory 1969 Some polyhedra related to combinatorial problems Linear Algebra Appl. 2 451 558 256718 10.1016/0024-3795(69)90017-2
    • (1969) Linear Algebra Appl. , vol.2 , pp. 451-558
    • Gomory, R.E.1
  • 7
    • 0000888402 scopus 로고
    • Some continuous functions related to corner polyhedra
    • 479415 10.1007/BF01584976
    • R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra Math. Program. 3 23 85 479415 10.1007/BF01584976
    • (1972) Math. Program. , vol.3 , pp. 23-85
    • Gomory, R.E.1    Johnson, E.L.2
  • 8
    • 0000888401 scopus 로고
    • Some continuous functions related to corner polyhedra, II
    • 479416 10.1007/BF01585008
    • R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra, II Math. Program. 3 359 389 479416 10.1007/BF01585008
    • (1972) Math. Program. , vol.3 , pp. 359-389
    • Gomory, R.E.1    Johnson, E.L.2
  • 9
    • 0343766978 scopus 로고
    • On the group problem for mixed integer programming
    • 10.1007/BFb0120692
    • E.L. Johnson 1974 On the group problem for mixed integer programming Math. Program. Stud. 2 137 179 10.1007/BFb0120692
    • (1974) Math. Program. Stud. , vol.2 , pp. 137-179
    • Johnson, E.L.1
  • 10
    • 67349196765 scopus 로고    scopus 로고
    • Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
    • 2505741 10.1007/s10107-008-0216-y
    • K. Kianfar Y. Fathi 2009 Generalized mixed integer rounding inequalities: facets for infinite group polyhedra Math. Program. 120 313 346 2505741 10.1007/s10107-008-0216-y
    • (2009) Math. Program. , vol.120 , pp. 313-346
    • Kianfar, K.1    Fathi, Y.2
  • 11
    • 77953870417 scopus 로고    scopus 로고
    • Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions
    • in press. doi: 10.1016/j.ejor.2010.04.021
    • Kianfar, K.; Fathi, Y.: Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions. Eur. J. Oper. Res. (2010, in press). doi: 10.1016/j.ejor.2010.04.021
    • (2010) Eur. J. Oper. Res.
    • Kianfar, K.1    Fathi, Y.2
  • 12
    • 0002496107 scopus 로고    scopus 로고
    • The 0-1 knapsack problem with a single continuous variable
    • 1689362 10.1007/s101070050044
    • H. Marchand L.A. Wolsey 1999 The 0-1 knapsack problem with a single continuous variable Math. Program. 85 15 33 1689362 10.1007/s101070050044
    • (1999) Math. Program. , vol.85 , pp. 15-33
    • Marchand, H.1    Wolsey, L.A.2
  • 13
    • 0035328755 scopus 로고    scopus 로고
    • Aggregation and mixed integer rounding to solve mips
    • H. Marchand L.A. Wolsey 2001 Aggregation and mixed integer rounding to solve MIPs Oper. Res. 49 363 371 1837356 10.1287/opre.49.3.363.11211 (Pubitemid 32672508)
    • (2001) Operations Research , vol.49 , Issue.3 , pp. 363-371
    • Marchand, H.1    Wolsey, L.A.2
  • 15
    • 0000689851 scopus 로고
    • A recursive procedure to generate all cuts for 0-1 mixed integer programs
    • 1054145 10.1007/BF01585752
    • G.L. Nemhauser L.A. Wolsey 1990 A recursive procedure to generate all cuts for 0-1 mixed integer programs Math. Program. 46 379 390 1054145 10.1007/BF01585752
    • (1990) Math. Program. , vol.46 , pp. 379-390
    • Nemhauser, G.L.1    Wolsey, L.A.2

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