THE MULTIPERIOD ASSIGNMENT PROBLEM - A MULTICOMMODITY NETWORK FLOW MODEL AND SPECIALIZED BRANCH AND BOUND ALGORITHM

被引：14

作者：

ARONSON, JE

机构：

[1] Southern Methodist Univ, Dep of, Operations Research &, Engineering Management, Dallas, TX,, Southern Methodist Univ, Dep of Operations Research & Engineering Management, Dallas, TX, USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1986年 / 23卷 / 03期

关键词：

D O I：

10.1016/0377-2217(86)90302-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：367 / 381

页数：15

共 51 条

[31] THE MULTI-INDEX PROBLEM [J].

HALEY, KB .

OPERATIONS RESEARCH, 1963, 11 (03) :368-379

[32] THE EXISTENCE OF A SOLUTION TO THE MULTI-INDEX PROBLEM [J].

HALEY, KB .

OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (04) :471-474

[33] MULTI-COMMODITY NETWORK FLOWS [J].

HU, TC .

OPERATIONS RESEARCH, 1963, 11 (03) :344-360

[34] EFFECTIVE SUBGRADIENT PROCEDURE FOR MINIMAL COST MULTICOMMODITY FLOW PROBLEMS [J].

KENNINGTON, J ;

SHALABY, M .

MANAGEMENT SCIENCE, 1977, 23 (09) :994-1004

[35] SURVEY OF LINEAR COST MULTICOMMODITY NETWORK FLOWS [J].

KENNINGTON, JL .

OPERATIONS RESEARCH, 1978, 26 (02) :209-236

[36]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[37] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

OPERATIONS RESEARCH, 1966, 14 (04) :699-+

[38]

LAWLER EL, 1977, P ADV RES I DISCRETE, P251

[39]

LEUE O, 1972, ANGEW INFORM, P154

[40]

MOORE EF, 1959, ANN COMPUTATION LABO, V30, P285

← 1 2 3 4 5 6 →