EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM

被引：129

作者：

AKINC, U

KHUMAWALA, BM

机构：

[1] MIDDLE E TECH UNIV, DEPT MANAGEMENT, ANKARA, TURKEY

[2] UNIV N CAROLINA, CHAPEL HILL, NC 27514 USA

来源：

关键词：

D O I：

10.1287/mnsc.23.6.585

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：585 / 594

页数：10

共 15 条

[1] AKINC U, 1974, THESIS U N CAROLINA
[2] DAVIS PS, 1969, NAV RES LOGIST Q, V16, P331
[3] ELLWEIN LB, 1970, 702 STANF U DEP IND
[4] ELLWEIN LB, 1971, AIIE T, V3, P290
[5] ELSHAFEI AN, 1974, OR90 N CAR STAT U RA
[6] ERLENKOTTER D, 1969, THESIS STANFORD U
[7] Ford L. R., 1962, FLOWS NETWORKS
[8] PRACTICAL SOLUTION OF LARGE MIXED INTEGER PROGRAMMING PROBLEMS WITH UMPIRE
FORREST, JJH
HIRST, JPH
TOMLIN, JA
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05): : 736 - 773
[9] INTEGER PROGRAMMING ALGORITHMS - FRAMEWORK AND STATE-OF-ART SURVEY
GEOFFRION, AM
MARSTEN, RE
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09): : 465 - 491
[10] GEOFFRION AM, 1975, SLOAN MANAGEMENT REV