A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
From MaRDI portal
Publication:4346340
DOI10.1287/opre.44.6.875zbMath0879.90155OpenAlexW4366111388MaRDI QIDQ4346340
Publication date: 3 August 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.6.875
Related Items
An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ An effective and simple heuristic for the set covering problem ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ Algorithms for railway crew management ⋮ Solving a bicriteria problem of optimal service centers location ⋮ A hybrid heuristic for the set covering problem ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Optimizing word set coverage for multi-event summarization ⋮ Matheuristics: survey and synthesis ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ A heuristic algorithm for the set covering problem ⋮ A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Lagrangian relaxation and pegging test for the clique partitioning problem ⋮ Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Surrogate constraint normalization for the set covering problem ⋮ Set covering approach for reconstruction of sibling relationships ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ What is the best greedy-like heuristic for the weighted set covering problem? ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ A Lagrangian-based heuristic for large-scale set covering problems ⋮ An adaptive heuristic algorithm for VLSI test vectors selection ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ A set covering based matheuristic for a real‐world city logistics problem ⋮ An linear programming based lower bound for the simple assembly line balancing problem ⋮ A set covering approach for multi-depot train driver scheduling ⋮ Column generation extensions of set covering greedy heuristics
