Interior point algorithm to solve computationally difficult set covering problems

被引：0

作者：

Karmarkar, Narendra ^{[1
]}

Resende, Mauricio G.C. ^{[1
]}

Ramakrishnan, K.G. ^{[1
]}

机构：

[1] AT&T Bell Lab, Murray Hill, NJ, United States

来源：

Mathematical Programming, Series B | 1991年 / 52卷 / 01期

关键词：

27;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：597 / 618

共 50 条

[1] AN INTERIOR POINT ALGORITHM TO SOLVE COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS
KARMARKAR, N
RESENDE, MGC
RAMAKRISHNAN, KG
MATHEMATICAL PROGRAMMING, 1991, 52 (03) : 597 - 618
[2] A NOTE ON SOME COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS
AVIS, D
MATHEMATICAL PROGRAMMING, 1980, 18 (02) : 138 - 145
[3] Genetic algorithms applied to computationally difficult set covering problems
Lorena, LAN
Lopes, LDS
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (04) : 440 - 445
[4] A PROBABILISTIC HEURISTIC FOR A COMPUTATIONALLY DIFFICULT SET COVERING PROBLEM
FEO, TA
RESENDE, MGC
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) : 67 - 71
[5] USING A FACILITY LOCATION ALGORITHM TO SOLVE LARGE SET COVERING PROBLEMS
VASKO, FJ
WILSON, GR
OPERATIONS RESEARCH LETTERS, 1984, 3 (02) : 85 - 90
[6] Solving difficult multicommodity problems with a specialized interior-point algorithm
Castro, J
ANNALS OF OPERATIONS RESEARCH, 2003, 124 (1-4) : 35 - 48
[7] Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm
Jordi Castro
Annals of Operations Research, 2003, 124 : 35 - 48
[8] Evolutionary Search Techniques to Solve Set Covering Problems
Gouwanda, Darwin
Ponnambalam, S. G.
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 29, 2008, 29 : 20 - 25
[9] A GRASP algorithm to solve the unicost set covering problem
Bautista, Joaquin
Pereira, Jordi
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 3162 - 3173
[10] ALGORITHM FOR SET-COVERING PROBLEMS
GONDRAN, M
LAURIERE, JL
REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, (NV2): : 33 - 51

← 1 2 3 4 5 →