CONSTRUCTIVE DUAL METHODS FOR DISCRETE PROGRAMMING

被引：4

作者：

BARCIA, P

机构：

[1] Univ Nova de Lisboa, Lisbon, Port, Univ Nova de Lisboa, Lisbon, Port

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 18卷 / 02期

关键词：

D O I：

10.1016/0166-218X(87)90014-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：107 / 117

页数：11

共 10 条

[1] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].

BALAS, E ;

ZEMEL, E .

OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154

[2] THE BOUND IMPROVING SEQUENCE ALGORITHM [J].

BARCIA, P .

OPERATIONS RESEARCH LETTERS, 1985, 4 (01) :27-30

[3]

BARCIA P, 1984, 18 U NOV LISB FAC EC

[4] CONVERGENT DUALITY THEORY FOR INTEGER PROGRAMMING [J].

BELL, DE ;

SHAPIRO, JF .

OPERATIONS RESEARCH, 1977, 25 (03) :419-434

[5]

DAVERSA J, 1983, THESIS MIT CAMBRIDGE

[6] ALGORITHMUS 47 - AN ALGORITHM FOR THE SOLUTION OF THE 0-1 KNAPSACK-PROBLEM [J].

FAYARD, D ;

PLATEAU, G .

COMPUTING, 1982, 28 (03) :269-287

[7]

HALDI J, 1964, 43 STANF U GRAD SCH

[8] ALGORITHM FOR SOLUTION OF 0-1 SINGLE KNAPSACK PROBLEM [J].

MARTELLO, S ;

TOTH, P .

COMPUTING, 1978, 21 (01) :81-86

[9]

Shapiro JF., 1979, MATH PROGRAMMING STR

[10]

1977, FUNCTIONAL MATH PROG

← 1 →