Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
From MaRDI portal
Publication:3875704
DOI10.1007/BFb0120886zbMath0435.90074MaRDI QIDQ3875704
No author found.
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
branch and bound; lower bounds; implementation; branching rules; computational study; comparison of algorithms; subgradient optimization; implicit enumeration; random test problems; prime covers; conditional bounds; computational testing; cutting planes, heuristics; set covering algorithms
65K05: Numerical mathematical programming methods
90C10: Integer programming
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Algorithms for solving the conditional covering problem on paths, Unnamed Item, Unnamed Item, Set covering approach for reconstruction of sibling relationships, Fast heuristics for large scale covering-location problems, Heuristic solutions and confidence intervals for the multicovering problem, Cutting planes in integer and mixed integer programming, Network models for vehicle and crew scheduling, Using a facility location algorithm to solve large set covering problems, A packet filter placement problem with application to defense against spoofed denial of service attacks, The bi-objective covering tour problem, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Surrogate constraint normalization for the set covering problem, Average and worst-case analysis of heuristics for the maximum tardiness problem, Entropy and set covering, Solving large set covering problems on a personal computer, A new approach for crew pairing problems by column generation with an application to air transportation, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A structural Lagrangean relaxation for two-duty period bus driver scheduling problems, On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\), On the 0,1 facets of the set covering polytope, On the facial structure of the set covering polytope, A probabilistic heuristic for a computationally difficult set covering problem, Facets and lifting procedures for the set covering polytope, Conditional clusters, musters, and probability, Enhancing an algorithm for set covering problems, The multicovering problem, Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach, An adaptation of SH heuristic to the location set covering problem, A genetic algorithm for the set covering problem, Computational experience with approximation algorithms for the set covering problem, A Lagrangian-based heuristic for large-scale set covering problems, Algorithms for large scale set covering problems, Pareto optimality and a class of set covering heuristics, Clustering heuristics for set covering, Experiments with parallel branch-and-bound algorithms for the set covering problem, State space relaxation for set covering problems related to bus driver scheduling, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, A column generation approach to job grouping for flexible manufacturing systems, A surrogate heuristic for set covering problems, On some difficult linear programs coming from set partitioning, Algorithms for railway crew management, Logical analysis of numerical data, Solving large set covering problems for crew scheduling, A comparison of algorithm RS with algorithm OPTSOL70, Graph theoretic relaxations of set covering and set partitioning problems, The design of a 0-1 integer optimizer and its application in the Carmen system, Hybrid heuristic algorithms for set covering., A neural network for the minimum set covering problem, A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, A tabu search approach to the constraint satisfaction problem as a general problem solver, Semi-greedy heuristics: An empirical study, An algorithm for set covering problem, Heuristic methods and applications: A categorized survey, Two new heuristics for the location set covering problem, An algorithm for large scale 0-1 integer programming with application to airline crew scheduling, Solving hard set covering problems, Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem, A 3-flip neighborhood local search for the set covering problem, Un nuevo resultado sobre la complejidad del problema delP-centro, An efficient heuristic for large set covering problems, A new reformulation approach for the generalized partial covering problem, The continuousm-center problem on a network, Hybrid heuristics for minimum cardinality set covering problems, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, Absolute bounds on optimal cost for a class of set covering problems, Worst case analysis of a class of set covering heuristics, A class of manpower scheduling problems
