A surrogate heuristic for set covering problems
type: Item
instance of: scholarly article
title: A surrogate heuristic for set covering problems
zbMATH Open document ID: 0813.90096
DOI: 10.1016/0377-2217(94)90401-4
author: Fábio Belo Lopes
author: Luiz Antonio Nogueira Lorena
published in: European Journal of Operational Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 709933
zbMATH Keywords: heuristic
zbMATH Keywords: set covering
zbMATH Keywords: continuous surrogate relaxations
zbMATH Keywords: subgradient optimization
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90401-4
OpenAlex ID: W2073316024
cites work: A generalization of Polyak's convergence result for subgradient optimization
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: Q3048579
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: On the choice of step size in subgradient optimization
cites work: An algorithm for set covering problem
cites work: Q4735035
cites work: Generalized Gradients and Applications
cites work: Note—A Computational Survey of Methods for the Set Covering Problem
cites work: Discrete-Variable Extremum Problems
cites work: Exact methods for the knapsack problem and its generalizations
cites work: Calculating surrogate constraints
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: A descent algorithm for nonsmooth convex optimization
cites work: Q4198056
cites work: The m-Center Problem: Minimax Facility Location
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: On convergence rates of subgradient optimization methods
cites work: The Generalized Penalty-Function/Surrogate Model
cites work: Validation of subgradient optimization
cites work: Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
cites work: Surrogate Dual Multiplier Search Procedures in Integer Programming
cites work: An aggregate subgradient method for nonsmooth convex minimization
cites work: An Algorithm for Large Set Partitioning Problems
cites work: Q4040221
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: Q5566712
cites work: Minimization of unsmooth functionals
cites work: A Way to Simplify Truth Functions
cites work: An Analysis of Private and Public Sector Location Models
cites work: Set Covering by an All Integer Algorithm
cites work: Q3804448
cites work: Q4733672
cites work: Q4880749
cites work: Q5187067
cites work: An efficient heuristic for large set covering problems
cites work: Solving large set covering problems on a personal computer
Recommended article: A Heuristic Method for the Set Covering Problem
Recommended article: A hybrid heuristic for the set covering problem
Recommended article: A heuristic algorithm for the set covering problem
Recommended article: An efficient heuristic for large set covering problems
Recommended article: Q4735035
Recommended article: An effective and simple heuristic for the set covering problem
Recommended article: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Recommended article: A two-phase heuristic for set covering
Recommended article: A heuristic algorithm for the multi-criteria set-covering problems
Recommended article: Hybrid heuristic algorithms for set covering.
description: scientific article; zbMATH DE number 709933