A Lagrangian-based heuristic for large-scale set covering problems
From MaRDI portal
Publication:1290617
DOI10.1007/BF01581106zbMATH Open0919.90085OpenAlexW2091836882MaRDI QIDQ1290617FDOQ1290617
Authors: Sebastián Ceria, Paolo Nobili, Antonio Sassano 
Publication date: 5 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581106
Recommendations
approximate solutionsrailways0-1 programmingsubgradient algorithmscrew-schedulingItalian railwaysLagrangian-based heuristiclarge-scale set-covering problemsprimal-dual Lagrangian
Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- A probabilistic heuristic for a computationally difficult set covering problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Title not available (Why is that?)
- A new approach for crew pairing problems by column generation with an application to air transportation
Cited In (47)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- 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
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A heuristic algorithm for the set covering problem
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- Simple Lagrangian heuristic for the set covering problem
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- An effective and simple heuristic for the set covering problem
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
- Model-based view planning
- Matheuristics: survey and synthesis
- Title not available (Why is that?)
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Primal convergence from dual subgradient methods for convex optimization
- An adaptation of SH heuristic to the location set covering problem
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- Heuristics for the variable sized bin-packing problem
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Improved handling of uncertainty and robustness in set covering problems
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- Algorithms for railway crew management
- An efficient mean field approach to the set covering problem
- A meta-heuristic extension of the Lagrangian heuristic framework
- Column generation extensions of set covering greedy heuristics
- Computational experience with general cutting planes for the set covering problem
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- An improved configuration checking-based algorithm for the unicost set covering problem
- Exploring further advantages in an alternative formulation for the set covering problem
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- A binary monkey search algorithm variation for solving the set covering problem
- Surrogate constraint normalization for the set covering problem
- On some difficult linear programs coming from set partitioning
- A hybrid heuristic for the set covering problem
- Solving large set covering problems for crew scheduling
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
This page was built for publication: A Lagrangian-based heuristic for large-scale set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290617)
