A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
From MaRDI portal
Recommendations
Cited in
(34)- An adaptive heuristic algorithm for VLSI test vectors selection
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- What is the best greedy-like heuristic for the weighted set covering problem?
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
- 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
- Column generation extensions of set covering greedy heuristics
- An improved configuration checking-based algorithm for the unicost set covering problem
- Lagrangian relaxation and pegging test for the clique partitioning problem
- A new approach for solving set covering problem using jumping particle swarm optimization method
- A set covering approach for multi-depot train driver scheduling
- 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
- An linear programming based lower bound for the simple assembly line balancing problem
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Solving a bicriteria problem of optimal service centers location
- A hybrid heuristic for the set covering problem
- A heuristic algorithm for the set covering problem
- Learning in combinatorial optimization: what and how to explore
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- A set covering based matheuristic for a real-world city logistics problem
- 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
- Set covering approach for reconstruction of sibling relationships
- Matheuristics: survey and synthesis
- Exploring further advantages in an alternative formulation for the set covering problem
- An effective and simple heuristic for the set covering problem
- A GRASP algorithm to solve the unicost set covering problem
- Optimizing word set coverage for multi-event summarization
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Surrogate constraint normalization for the set covering problem
This page was built for publication: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346340)
