Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems

DOI10.1057/jors.1988.115zbMath0643.90061OpenAlexW2088339996MaRDI QIDQ3786281

Gary A. Kochenberger, C. Gregory John

Publication date: 1988

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1988.115

zbMATH Keywords

Lagrange multipliersbranch-and-boundComputational resultsset-coveringLagrangian relaxationsadding a single surrogate constraintLagrangian subproblems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (7)

A surrogate heuristic for set covering problems ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Searching for optimal integer solutions to set partitioning problems using column generation ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Surrogate constraint normalization for the set covering problem ⋮ Dual-based heuristics for a hierarchical covering location problem

This page was built for publication: Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems