Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Cited in

(36)

Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
IP over 40+ years at IBM scientific centers and marketing
A note on some computationally difficult set covering problems
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network
Heuristic methods and applications: A categorized survey
Enumeration technique for set covering problems: a combinatorial approach
On solving multi objective set covering problem with imprecise linear fractional objectives
Implicit enumeration algorithms for the set-partitioning problem
Algorithms for large scale set covering problems
Heuristically aided set-covering algorithms
Facets and lifting procedures for the set covering polytope
On the facial structure of the set covering polytope
An algorithm for obtaining the chromatic number and an optimal coloring of a graph
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
The mixed postman problem
Relation between set partitioning and set covering problems with quadratic fractional objective functions
A search algorithm for the minimum cost covering of 0-1 integers sets
A language and a program for stating and solving combinatorial problems
Use of location-allocation models in health service development planning in developing nations
On a linearization technique for solving the quadratic set covering problem and variations
A shrunken cyclic inspection schedule for deteriorating production stages
Advances in the decision-making of set covering models under uncertainty
The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
Airline crew scheduling: state-of-the-art
The simple plant location problem: Survey and synthesis
Opening a web site at which one can get a benchmark input data set to solve the set covering problem
The multicovering problem
Performance of a neural network method with set partitioning
Benchmark data set with service programs to approximately solve the set covering problem
A computational study of a genetic algorithm to solve the set covering problem
A Linearization technique for solving the quadratic set covering problem
Vertex packings: Structural properties and algorithms
Logical processing for integer programming
Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
A goal programming approach to solve linear fractional multi-objective set covering problem.

This page was built for publication: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5641000)