Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
From MaRDI portal
Publication:5641000
DOI10.1287/opre.19.4.998zbMath0232.90033OpenAlexW1972106066MaRDI QIDQ5641000
Harvey M. Salkin, Kurt Spielberg, C. E. Lemke
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.19.4.998
Related Items
A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, On the facial structure of the set covering polytope, Facets and lifting procedures for the set covering polytope, On a linearization technique for solving the quadratic set covering problem and variations, Relation between set partitioning and set covering problems with quadratic fractional objective functions, Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming, Implicit enumeration algorithms for the set-partitioning problem, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, A Linearization technique for solving the quadratic set covering problem, A search algorithm for the minimum cost covering of 0-1 integers sets, Vertex packings: Structural properties and algorithms, Performance of a neural network method with set partitioning, A goal programming approach to solve linear fractional multi-objective set covering problem., The multicovering problem, IP over 40+ years at IBM scientific centers and marketing, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, Heuristically aided set-covering algorithms, Benchmark data set with service programs to approximately solve the set covering problem, Enumeration technique for set covering problems: a combinatorial approach, A note on some computationally difficult set covering problems, A language and a program for stating and solving combinatorial problems, Opening a web site at which one can get a benchmark input data set to solve the set covering problem, The mixed postman problem, A shrunken cyclic inspection schedule for deteriorating production stages, Heuristic methods and applications: A categorized survey, A computational study of a genetic algorithm to solve the set covering problem, Use of location-allocation models in health service development planning in developing nations, The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory, The simple plant location problem: Survey and synthesis, On solving multi objective Set Covering Problem with imprecise linear fractional objectives, Algorithms for large scale set covering problems, Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives, Logical processing for integer programming, Airline crew scheduling: state-of-the-art
