Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Integer programming (90C10)

Recommendations

An algorithm for set covering problem
scientific article; zbMATH DE number 3968330
The set covering problem revisited: an empirical study of the value of dual information
Heuristics, cutting planes and subgradient optimization for set partitioning problems
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Cited in

(74)

Enhancing an algorithm for set covering problems
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
An adaptation of SH heuristic to the location set covering problem
A genetic algorithm for the set covering problem
Simple Lagrangian heuristic for the set covering problem
A multi-product loading problem: A model and solution method
A Lagrangian-based heuristic for large-scale set covering problems
Clustering heuristics for set covering
Experiments with parallel branch-and-bound algorithms for the set covering problem
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
An algorithm for the planar three-index assignment problem
A surrogate heuristic for set covering problems
Algorithms for railway crew management
Solving large set covering problems for crew scheduling
Relation between set covering and set partitioning problems
Graph theoretic relaxations of set covering and set partitioning problems
Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management.
Hybrid heuristic algorithms for set covering.
Evaluation of reliability bounds by set covering models.
A parallel genetic algorithm to solve the set-covering problem
A concurrent processing framework for the set partitioning problem
The matching relaxation for a class of generalized set partitioning problems
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
An application-oriented guide for designing Lagrangean dual ascent algorithms
Lagrangean relaxation. (With comments and rejoinder).
A monotonic, dual-based bounding procedure for integer programs
A dual strategy for solving the linear programming relaxation of a driver scheduling system
Application of a hybrid genetic algorithm to airline crew scheduling
Tighter representations for set partitioning problems
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Solving hard set covering problems
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
Efficient feature selection for logical analysis of large-scale multi-class datasets
An improved configuration checking-based algorithm for the unicost set covering problem
A new approach for solving set covering problem using jumping particle swarm optimization method
Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
A set covering approach for multi-depot train driver scheduling
A simulated evolution-based solution of the cover problem
Humanitarian logistics planning for natural disaster response with Bayesian information updates
A relax-and-cut algorithm for the set partitioning problem
A 3-flip neighborhood local search for the set covering problem
The set covering problem revisited: an empirical study of the value of dual information
A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company
Optimal set-partitioning based on group quality likelihood using partition-growing algorithm
Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
Effective heuristics for the set covering with pairs problem
Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
An efficient local search heuristic with row weighting for the unicost set covering problem
scientific article; zbMATH DE number 3875302 (Why is no real title available?)
Modeling and Managing Uncertainty in Process Planning and Scheduling
A hybrid heuristic for the set covering problem
scientific article; zbMATH DE number 3968330 (Why is no real title available?)
Worst case analysis of two heuristics for the set partitioning problem
A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program
A heuristic algorithm for the set covering problem
Use of hidden network structure in the set partitioning problem
Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
A self-adaptive biogeography-based algorithm to solve the set covering problem
Heuristics, cutting planes and subgradient optimization for set partitioning problems
The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
Solving a fuzzy set-covering problem
Set covering approach for reconstruction of sibling relationships
Matheuristics: survey and synthesis
MLQCC: an improved local search algorithm for the set k‐covering problem
A binary monkey search algorithm variation for solving the set covering problem
Exploring further advantages in an alternative formulation for the set covering problem
A packet filter placement problem with application to defense against spoofed denial of service attacks
An effective and simple heuristic for the set covering problem
Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
A GRASP algorithm to solve the unicost set covering problem
A dual ascent procedure for the set partitioning problem
Surrogate constraint normalization for the set covering problem

This page was built for publication: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

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