메뉴 건너뛰기




Volumn 44, Issue 3, 1998, Pages 301-310

A mixed integer programming model for solving a layout problem in the fashion industry

Author keywords

Cutting Stock Problem; Fashion Industry; Layout Problem; Mixed Integer Programming

Indexed keywords

COST EFFECTIVENESS; FORECASTING; INTEGER PROGRAMMING; MARKETING; MATHEMATICAL MODELS; PRODUCTIVITY;

EID: 0032025944     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.3.301     Document Type: Article
Times cited : (40)

References (8)
  • 3
    • 0019635339 scopus 로고
    • A New Linear Programming Approach to the Cutting Stock Problem
    • Dyckhoff, H., "A New Linear Programming Approach to the Cutting Stock Problem," Oper. Res., 29 (1981), 1092-1104.
    • (1981) Oper. Res. , vol.29 , pp. 1092-1104
    • Dyckhoff, H.1
  • 4
    • 0001510482 scopus 로고
    • A Linear Programming Approach to the Cutting Stock Problem
    • Gilmore, P. C. and R. E. Gomory, "A Linear Programming Approach to the Cutting Stock Problem," Oper. Res., 9 (1961), 849-859.
    • (1961) Oper. Res. , vol.9 , pp. 849-859
    • Gilmore, P.C.1    Gomory, R.E.2
  • 5
    • 0000143954 scopus 로고
    • A Linear Programming Approach to the Cutting Stock Problem - Part II
    • _ and R. E. Gomory, "A Linear Programming Approach to the Cutting Stock Problem - Part II," Oper. Res., 11 (1963), 863-888.
    • (1963) Oper. Res. , vol.11 , pp. 863-888
    • Gomory, R.E.1


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