메뉴 건너뛰기




Volumn 135, Issue 1, 2012, Pages 94-105

A DC programming heuristic applied to the logistics network design problem

Author keywords

DC programming; Heuristics; Logistics network design; Mixed integer linear programming

Indexed keywords

D-C PROGRAMMING; DATA SETS; HEURISTICS; LINEAR RELAXATIONS; LOGISTICS NETWORK; LOGISTICS NETWORK DESIGN; MIXED INTEGER LINEAR PROGRAMMING; MIXED INTEGER LINEAR PROGRAMMING MODEL; MULTI-COMMODITY; MULTI-PERIOD; MULTI-PRODUCTS; MULTIECHELON; NUMERICAL RESULTS;

EID: 80055059034     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2010.09.025     Document Type: Article
Times cited : (27)

References (27)
  • 2
    • 0032136666 scopus 로고    scopus 로고
    • Supply chain design and analysis: Models and methods
    • B.M. Beamon Supply chain design and analysis: models and methods International Journal of Production Economics 55 3 1998 281 294
    • (1998) International Journal of Production Economics , vol.55 , Issue.3 , pp. 281-294
    • Beamon, B.M.1
  • 3
    • 0020764598 scopus 로고
    • A property of assignment type mixed integer linear programming problems
    • J. Benders, and J.A.E.E. van Nunen A property of assignment type mixed integer linear programming problems Operations Research Letters 2 1983 47 52
    • (1983) Operations Research Letters , vol.2 , pp. 47-52
    • Benders, J.1    Van Nunen, J.A.E.E.2
  • 4
    • 33846586040 scopus 로고    scopus 로고
    • A feasibility pump heuristic for general mixed-integer problems
    • L. Bertacco, M. Fischetti, and A. Lodi A feasibility pump heuristic for general mixed-integer problems Discrete Optimization 4 2007 63 76
    • (2007) Discrete Optimization , vol.4 , pp. 63-76
    • Bertacco, L.1    Fischetti, M.2    Lodi, A.3
  • 6
    • 0042522794 scopus 로고    scopus 로고
    • Upper and lower bounds for the single source capacitated location problem
    • M.J. Cortinhal, and M.E.V. Captivo Upper and lower bounds for the single source capacitated location problem European Journal of Operational Research 151 2 2003 333 351
    • (2003) European Journal of Operational Research , vol.151 , Issue.2 , pp. 333-351
    • Cortinhal, M.J.1    Captivo, M.E.V.2
  • 8
    • 69949095267 scopus 로고    scopus 로고
    • Constructing a DC decomposition for ordered median problems
    • Z. Drezner, and S. Nickel Constructing a DC decomposition for ordered median problems Journal of Global Optimization 45 2 2009 187 201
    • (2009) Journal of Global Optimization , vol.45 , Issue.2 , pp. 187-201
    • Drezner, Z.1    Nickel, S.2
  • 10
    • 33846039835 scopus 로고    scopus 로고
    • An lp-based heuristic procedure for the generalized assignment problem with special ordered sets
    • A.P. French, and J.M. Wilson An lp-based heuristic procedure for the generalized assignment problem with special ordered sets Computers & Operations Research 34 8 2007 2359 2369
    • (2007) Computers & Operations Research , vol.34 , Issue.8 , pp. 2359-2369
    • French, A.P.1    Wilson, J.M.2
  • 11
    • 33749671280 scopus 로고    scopus 로고
    • Analysis of bounds for a capacitated single-item lot-sizing problem
    • part Special Issue: Odysseus 2003 Second International Workshop on Freight Transportation Logistics
    • J.R. Hardin, G.L. Nemhauser, and M.W. Savelsbergh Analysis of bounds for a capacitated single-item lot-sizing problem Computers & Operations Research 34 6 2007 1721 1743 part Special Issue: Odysseus 2003 Second International Workshop on Freight Transportation Logistics
    • (2007) Computers & Operations Research , vol.34 , Issue.6 , pp. 1721-1743
    • Hardin, J.R.1    Nemhauser, G.L.2    Savelsbergh, M.W.3
  • 12
    • 34447093639 scopus 로고    scopus 로고
    • A continuous dc programming approach to the strategic supply chain design problem from qualified partner set
    • H.A. Le Thi, P. Nguyen Trong, and D.T. Pham A continuous dc programming approach to the strategic supply chain design problem from qualified partner set European Journal of Operational Research 183 3 2007 1001 1012
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1001-1012
    • Le Thi, H.A.1    Nguyen Trong, P.2    Pham, D.T.3
  • 13
    • 15244346000 scopus 로고    scopus 로고
    • The DC (difference of convex functions) programming and DCA revisited with dc models of real world nonconvex optimization problems
    • H.A. Le Thi, and D.T. Pham The DC (difference of convex functions) programming and DCA revisited with dc models of real world nonconvex optimization problems Annals of Operations Research 133 1-4 2005 23 46
    • (2005) Annals of Operations Research , vol.133 , Issue.14 , pp. 23-46
    • Le Thi, H.A.1    Pham, D.T.2
  • 14
    • 38049053083 scopus 로고    scopus 로고
    • A continuous approach for the concave cost supply problem via DC programming and DCA
    • H.A. Le Thi, and D.T. Pham A continuous approach for the concave cost supply problem via DC programming and DCA Discrete Applied Mathematics 156 3 2008 325 338
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.3 , pp. 325-338
    • Le Thi, H.A.1    Pham, D.T.2
  • 16
    • 33845962879 scopus 로고    scopus 로고
    • Lp-based approximation algorithms for capacitated facility location
    • R. Levi, D.B. Shmoys, and C. Swamy Lp-based approximation algorithms for capacitated facility location Lecture Notes in Computer Science 3064 2004 21 27
    • (2004) Lecture Notes in Computer Science , vol.3064 , pp. 21-27
    • Levi, R.1    Shmoys, D.B.2    Swamy, C.3
  • 17
    • 0033889979 scopus 로고    scopus 로고
    • The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach
    • E. Melachrinoudis, and H. Min The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: a multiple objective approach European Journal of Operational Research 123 1 2000 1 15
    • (2000) European Journal of Operational Research , vol.123 , Issue.1 , pp. 1-15
    • Melachrinoudis, E.1    Min, H.2
  • 19
    • 21444448152 scopus 로고    scopus 로고
    • Dynamic multi-commodity capacitated facility location: A mathematical modeling framework for strategic supply chain planning
    • M.T. Melo, S. Nickel, and F. Saldanha da Gama Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning Computers & Operations Research 33 1 2006 181 208
    • (2006) Computers & Operations Research , vol.33 , Issue.1 , pp. 181-208
    • Melo, M.T.1    Nickel, S.2    Saldanha Da Gama, F.3
  • 22
    • 77956934563 scopus 로고
    • Algorithms for solving a class of non convex optimization problems: Methods of subgradients
    • J.-B. Hiriart-Urruty, North-Holland Mathematics Studies, Elsevier Science Publishers Amsterdam
    • D.T. Pham, and S. El Bernoussi Algorithms for solving a class of non convex optimization problems: methods of subgradients J.-B. Hiriart-Urruty, Fermat Days 85: Mathematics for Optimization vol. 129 1986 North-Holland Mathematics Studies, Elsevier Science Publishers Amsterdam 249 270
    • (1986) Fermat Days 85: Mathematics for Optimization , vol.129 , pp. 249-270
    • Pham, D.T.1    El Bernoussi, S.2
  • 23
    • 33846081870 scopus 로고    scopus 로고
    • A review of hierarchical facility location models
    • G. Sahin, and H. Süral A review of hierarchical facility location models Computers & Operations Research 34 8 2007 2310 2331
    • (2007) Computers & Operations Research , vol.34 , Issue.8 , pp. 2310-2331
    • Sahin, G.1    Süral, H.2
  • 25
    • 43749104912 scopus 로고    scopus 로고
    • A dynamic model for facility location in the design of complex supply chains
    • P.N. Thanh, N. Bostel, and O. Péton A dynamic model for facility location in the design of complex supply chains International Journal of Production Economics 113 2 2008 678 693
    • (2008) International Journal of Production Economics , vol.113 , Issue.2 , pp. 678-693
    • Thanh, P.N.1    Bostel, N.2    Péton, O.3
  • 26
    • 78049384163 scopus 로고    scopus 로고
    • A linear relaxation-based heuristic for logistics network design
    • Thanh, P.N., Bostel, N., Péton, O., 2010. A linear relaxation-based heuristic for logistics network design. Computers & Industrial Engineering 59 (4), 964975
    • (2010) Computers & Industrial Engineering , vol.59 , Issue.4 , pp. 964975
    • Thanh, P.N.1    Bostel, N.2    Péton, O.3


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