Surrogate constraint normalization for the set covering problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A Greedy Heuristic for the Set-Covering Problem
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Computational experience with approximation algorithms for the set covering problem
On the hardness of approximating minimization problems
A probabilistic heuristic for a computationally difficult set covering problem
A note on some computationally difficult set covering problems
Surrogate Mathematical Programming
A Lagrangian-based heuristic for large-scale set covering problems
An efficient heuristic for large set covering problems
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
Surrogate Constraint Duality in Mathematical Programming
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
A Heuristic Method for the Set Covering Problem
Surrogate Constraints
A set covering reformulation of the pure fixed charge transportation problem
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
Clustering heuristics for set covering
A surrogate heuristic for set covering problems
Tutorial on surrogate constraint approaches for optimization in graphs
Calculating surrogate constraints
A neural network for the minimum set covering problem
Using a facility location algorithm to solve large set covering problems
Surrogate Constraints in Integer Programming
Solving large set covering problems on a personal computer
An adaptation of SH heuristic to the location set covering problem
Few statistical tests for proportions comparison
Simple Lagrangian heuristic for the set covering problem
Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
Genetic algorithms applied to computationally difficult set covering problems

Cited In (8)

Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Optimizing word set coverage for multi-event summarization
Exploring further advantages in an alternative formulation for the set covering problem
A set covering approach for multi-depot train driver scheduling
Zero duality gap in surrogate constraint optimization: a concise review of models
Three algorithms for graph locally harmonious colouring
A surrogate-based heuristic for production planning problem of orders in small foundries
What is the best greedy-like heuristic for the weighted set covering problem?

Uses Software

RAMP

   Recommendations

This page was built for publication: Surrogate constraint normalization for the set covering problem

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