FLEXIBLE TREE-SEARCH METHOD FOR INTEGER PROGRAMMING PROBLEMS

被引：11

作者：

TUAN, NP

机构：

来源：

OPERATIONS RESEARCH | 1971年 / 19卷 / 01期

关键词：

D O I：

10.1287/opre.19.1.115

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：115 / &

共 10 条

[1] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].

BALAS, E .

OPERATIONS RESEARCH, 1965, 13 (04) :517-&

[2] DISCRETE PROGRAMMING BY FILTER METHOD [J].

BALAS, E .

OPERATIONS RESEARCH, 1967, 15 (05) :915-+

[3]

BALINSKI ML, 1965, MANAGEMENT SCIENCE, V12, P252

[4]

BERTIER P, 1965, SEMA33 DIR ET NOT TR

[5] INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS METHOD [J].

GEOFFRION, AM .

SIAM REVIEW, 1967, 9 (02) :178-+

[6] A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].

GLOVER, F .

OPERATIONS RESEARCH, 1965, 13 (06) :879-&

[7] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].

LAND, AH ;

DOIG, AG .

ECONOMETRICA, 1960, 28 (03) :497-520

[8] DIRECT SEARCH ALGORITHMS FOR ZERO-1 AND MIXED-INTEGER PROGRAMMING [J].

LEMKE, CE ;

SPIELBER.K .

OPERATIONS RESEARCH, 1967, 15 (05) :892-+

[9] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

OPERATIONS RESEARCH, 1963, 11 (06) :972-989

[10]

TUAN NP, 1967, PROBLEMES ORDONNANCE

← 1 →