메뉴 건너뛰기




Volumn , Issue , 2000, Pages 780-785

Solving a Supply Chain Optimization Problem Collaboratively

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; CONSTRAINT THEORY; INTEGER PROGRAMMING; INVENTORY CONTROL; SUPPLY CHAIN MANAGEMENT; VEHICLE ROUTING;

EID: 0012257606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (12)
  • 1
    • 0000914682 scopus 로고    scopus 로고
    • Solving an Integrated Logistics Problem Arising in Grocery Distribution
    • M. W. Carter, J. M. Farvolden, G. Laporte, J. Xu, Solving an Integrated Logistics Problem Arising in Grocery Distribution, INFOR, 34:4 (1996), 290-306.
    • (1996) INFOR , vol.34 , Issue.4 , pp. 290-306
    • Carter, M. W.1    Farvolden, J. M.2    Laporte, G.3    Xu, J.4
  • 2
    • 0031701710 scopus 로고    scopus 로고
    • Probabilistic Analysis and Practical Algorithms for Inventory-Routing Models
    • L. M. Chan, A. Fedegruen and D. Simchi-Levi, Probabilistic Analysis and Practical Algorithms for Inventory-Routing Models, Operations Research, 46:1 (1998) 96-106.
    • (1998) Operations Research , vol.46 , Issue.1 , pp. 96-106
    • Chan, L. M.1    Fedegruen, A.2    Simchi-Levi, D.3
  • 3
    • 0012304293 scopus 로고    scopus 로고
    • An Inventory Management Problem
    • Y. Caseau and T. Kokeny, An Inventory Management Problem, Constraints, 3, (1998), 363-373.
    • (1998) Constraints , vol.3 , pp. 363-373
    • Caseau, Y.1    Kokeny, T.2
  • 5
    • 0019032810 scopus 로고
    • Deterministic Production Planning: Algorithm and Complexity
    • M. Florian, J. K. Lenstra, and A. H. G. Rinnooy Kan, Deterministic Production Planning: Algorithm and Complexity, Management Sc., 26:7 (1980), 669-679.
    • (1980) Management Sc , vol.26 , Issue.7 , pp. 669-679
    • Florian, M.1    Lenstra, J. K.2    Rinnooy Kan, A. H. G.3
  • 6
    • 0021517128 scopus 로고
    • An Efficient Algorithm for Computing Optimal (s,S) Policies
    • A. Fedegruen and P. Zipkin, An Efficient Algorithm for Computing Optimal (s,S) Policies, Operations Research, 22 (1984), 1268-1285.
    • (1984) Operations Research , vol.22 , pp. 1268-1285
    • Fedegruen, A.1    Zipkin, P.2
  • 10
    • 0020884951 scopus 로고
    • Computational Experience with Advanced Decomposition of Decomposition Algorithms
    • J. K. Ho and E. Loute, Computational Experience with Advanced Decomposition of Decomposition Algorithms, Math Programming, 27:3, (1983), 283-290.
    • (1983) Math Programming , vol.27 , Issue.3 , pp. 283-290
    • Ho, J. K.1    Loute, E.2
  • 11
    • 0000110116 scopus 로고
    • Local Search for Routing Problems with Time Windows
    • M. W. P. Savelsbergh, Local Search for Routing Problems with Time Windows, Annals of Operations Research, 4, (1986), 285-305.
    • (1986) Annals of Operations Research , vol.4 , pp. 285-305
    • Savelsbergh, M. W. P.1
  • 12
    • 0023313252 scopus 로고
    • Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints
    • M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research, 35, 1987, 254-265.
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M. M.1


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