A surrogate heuristic for set covering problems
From MaRDI portal
Publication:1342046
DOI10.1016/0377-2217(94)90401-4zbMath0813.90096OpenAlexW2073316024MaRDI QIDQ1342046
Fábio Belo Lopes, Luiz Antonio Nogueira Lorena
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90401-4
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A bibliography for some fundamental problem categories in discrete location science, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Algorithms for railway crew management, A GRASP algorithm to solve the unicost set covering problem, A comparison of algorithm RS with algorithm OPTSOL70, Matheuristics: survey and synthesis, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Hybrid heuristic algorithms for set covering., A column generation approach to capacitated \(p\)-median problems, A relax-and-cut algorithm for the set partitioning problem, A heuristic algorithm for the set covering problem, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, Surrogate constraint normalization for the set covering problem, Spherical classification of data, a new rule-based learning method, Lagrangean/surrogate relaxation for generalized assignment problems, An adaptation of SH heuristic to the location set covering problem, Relaxation heuristics for a generalized assignment problem, A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, A tabu search approach to the constraint satisfaction problem as a general problem solver
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact methods for the knapsack problem and its generalizations
- Solving large set covering problems on a personal computer
- On the choice of step size in subgradient optimization
- An algorithm for the solution of the 0-1 knapsack problem
- An algorithm for set covering problem
- An aggregate subgradient method for nonsmooth convex minimization
- A Way to Simplify Truth Functions
- An efficient heuristic for large set covering problems
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- A descent algorithm for nonsmooth convex optimization
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A generalization of Polyak's convergence result for subgradient optimization
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- An Algorithm for Large Zero-One Knapsack Problems
- Calculating surrogate constraints
- An Algorithm for Large Set Partitioning Problems
- Generalized Gradients and Applications
- Note—A Computational Survey of Methods for the Set Covering Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- On convergence rates of subgradient optimization methods
- The m-Center Problem: Minimax Facility Location
- Validation of subgradient optimization
- Discrete-Variable Extremum Problems
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- An Analysis of Private and Public Sector Location Models
- Minimization of unsmooth functionals
- Set Covering by an All Integer Algorithm
- The Generalized Penalty-Function/Surrogate Model
