An interior point algorithm to solve computationally difficult set covering problems
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (1-3) , 597-618
- https://doi.org/10.1007/bf01582907
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An interior-point approach to NP-complete problems. IContemporary Mathematics, 1990
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Experimental results on Hillier's linear searchMathematical Programming, 1975
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- A heuristic algorithm for mixed-integer programming problemsPublished by Springer Nature ,1974
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974
- An Algorithm for Least-Squares Estimation of Nonlinear ParametersJournal of the Society for Industrial and Applied Mathematics, 1963