STRONG FORMULATIONS FOR MIXED INTEGER PROGRAMMING - A SURVEY

被引：26

作者：

WOLSEY, L

机构：

来源：

MATHEMATICAL PROGRAMMING | 1989年 / 45卷 / 01期

关键词：

D O I：

10.1007/BF01589102

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：173 / 191

页数：19

共 35 条

[1] COMPUTATIONALLY EFFICIENT OPTIMAL-SOLUTIONS TO THE LOT-SIZING PROBLEM IN MULTISTAGE ASSEMBLY SYSTEMS [J].

AFENTAKIS, P ;

GAVISH, B ;

KARMARKAR, U .

MANAGEMENT SCIENCE, 1984, 30 (02) :222-239

[2] THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH [J].

BALAS, E ;

PULLEYBLANK, W .

NETWORKS, 1983, 13 (04) :495-516

[3]

BALAS E, 1985, MATH PROGRAM STUD, V24, P179, DOI 10.1007/BFb0121051

[4]

Balas E., 1979, ANN DISCRETE MATH, V5, P3

[5]

BARANY I, 1984, MATH PROGRAM STUD, V22, P32, DOI 10.1007/BFb0121006

[6] STRONG FORMULATIONS FOR MULTI-ITEM CAPACITATED LOT SIZING [J].

BARANY, I ;

VANROY, TJ ;

WOLSEY, LA .

MANAGEMENT SCIENCE, 1984, 30 (10) :1255-1261

[7]

BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]

[8] SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].

CROWDER, H ;

JOHNSON, EL ;

PADBERG, M .

OPERATIONS RESEARCH, 1983, 31 (05) :803-834

[9] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].

CROWDER, H ;

PADBERG, MW .

MANAGEMENT SCIENCE, 1980, 26 (05) :495-509

[10]

EPPEN GD, 1985, SOLVING MULTIITEM CA

← 1 2 3 4 →