메뉴 건너뛰기




Volumn 85, Issue , 2015, Pages 402-413

Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking

Author keywords

Containerization; Freight consolidation; Heuristics; Integer programming; Logistics

Indexed keywords

CONTAINERS; INTEGER PROGRAMMING; LOGISTICS; PACKAGING;

EID: 84929611690     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2015.04.023     Document Type: Article
Times cited : (7)

References (11)
  • 1
    • 85132117646 scopus 로고    scopus 로고
    • Static pickup and delivery problems: A classification scheme and survey
    • G. Berbeglia, J-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: A classification scheme and survey TOP 15 2007 1 31
    • (2007) TOP , vol.15 , pp. 1-31
    • Berbeglia, G.1    Cordeau, J.-F.2    Gribkovskaia, I.3    Laporte, G.4
  • 2
    • 40149111192 scopus 로고    scopus 로고
    • On the asymmetric representatives formulation for the vertex coloring problem
    • M. Campêlo, V.A. Campos, and R.C. Corrêa On the asymmetric representatives formulation for the vertex coloring problem Discrete Applied Mathematics 156 2008 1097 1111
    • (2008) Discrete Applied Mathematics , vol.156 , pp. 1097-1111
    • Campêlo, M.1    Campos, V.A.2    Corrêa, R.C.3
  • 4
    • 84874733909 scopus 로고    scopus 로고
    • Dynamic approach to solve the daily drayage problem with transit time uncertainty
    • A. Escudero, J. Muñuzuri, J. Guadix, and C. Arango Dynamic approach to solve the daily drayage problem with transit time uncertainty Computers in Industry 64 2013 165 175
    • (2013) Computers in Industry , vol.64 , pp. 165-175
    • Escudero, A.1    Muñuzuri, J.2    Guadix, J.3    Arango, C.4
  • 5
    • 77951223847 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for partition coloring
    • Y. Frota, N. Maculan, T.F. Noronha, and C.C. Ribeiro A branch-and-cut algorithm for partition coloring Networks 55 2010 194 204
    • (2010) Networks , vol.55 , pp. 194-204
    • Frota, Y.1    Maculan, N.2    Noronha, T.F.3    Ribeiro, C.C.4
  • 7
    • 84871810724 scopus 로고    scopus 로고
    • Efficient symmetry breaking formulations for the job grouping problem
    • R. Jans, and J. Desrosiers Efficient symmetry breaking formulations for the job grouping problem Computers & Operations Research 40 2013 1132 1142
    • (2013) Computers & Operations Research , vol.40 , pp. 1132-1142
    • Jans, R.1    Desrosiers, J.2
  • 8
    • 84885758003 scopus 로고    scopus 로고
    • Symmetry in integer linear programming
    • M. Jünger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, Springer Berlin
    • F. Margot Symmetry in integer linear programming M. Jünger, T.M. Liebling, D. Naddef, G.L. Nemhauser, W.R. Pulleyblank, G. Reinelt, 50 Years of integer programming 1958-2008 2010 Springer Berlin 647 686
    • (2010) 50 Years of integer programming 1958-2008 , pp. 647-686
    • Margot, F.1


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