An interior point algorithm to solve computationally difficult set covering problems

Authors:
Narendra Karmarkar;Mauricio G. C. Resende;K. G. Ramakrishnan
Affiliations:
-;-;-
Venue:
Mathematical Programming: Series A and B - Special issue on interior point methods for linear programming: theory and practice
Year:
1991

Citing 0
Cited 8

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Journal of Heuristics
A Branch and Bound Method via d.c. Optimization Algorithms andEllipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

Journal of Global Optimization
Extending SQL with graph matching and set covering for decision support applications

Journal of Management Information Systems
Constraint orbital branching

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An approach to guided learning of boolean functions

Mathematical and Computer Modelling: An International Journal
Solving large Steiner Triple Covering Problems

Operations Research Letters
Solving hard set covering problems

Operations Research Letters
Potential reduction algorithms for structured combinatorial optimization problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract