Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics

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

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

(72)

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

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)