CONCAVE PROGRAMMING APPLIED TO A SPECIAL CLASS OF 0-1 INTEGER PROGRAMS

被引：19

作者：

GLOVER, F

KLINGMAN, D

机构：

[1] UNIV COLORADO, BOULDER, CO 80302 USA

[2] UNIV TEXAS, AUSTIN, TX 78712 USA

来源：

OPERATIONS RESEARCH | 1973年 / 21卷 / 01期

关键词：

D O I：

10.1287/opre.21.1.135

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：135 / 140

页数：6

共 10 条

[1] INTERSECTION CUT FROM DUAL OF UNIT HYPERCUBE [J].

BALAS, E ;

BOWMAN, VJ ;

GLOVER, F ;

SOMMER, D .

OPERATIONS RESEARCH, 1971, 19 (01) :40-+

[2] INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].

BALAS, E .

OPERATIONS RESEARCH, 1971, 19 (01) :19-+

[3]

BURDET CA, 1970, 220 CARN MELL U MAN

[4] CONVEXITY CUTS AND CUT SEARCH [J].

GLOVER, F .

OPERATIONS RESEARCH, 1973, 21 (01) :123-134

[5]

GLOVER F, 1969, CONVEXITY CUTS

[6] ON CONNECTIONS BETWEEN ZERO-ONE INTEGER PROGRAMMING AND CONCAVE PROGRAMMING UNDER LINEAR CONSTRAINTS [J].

RAGHAVACHARI, M .

OPERATIONS RESEARCH, 1969, 17 (04) :680-+

[7]

TUI H, 1964, SOV MATH, P1437

[8]

TUI H, 1964, DOKLADY AKADEMII NAU

[9]

YOUNG RA, TO BE PUBLISHED

[10]

YOUNG RD, 1968, OCT RICE U APPL MATH

← 1 →