A Lagrangian-based heuristic for large-scale set covering problems
From MaRDI portal
(Redirected from A Lagrangian-based heuristic for large-scale set covering problems)
Recommendations
Cites work
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Greedy Heuristic for the Set-Covering Problem
- A new approach for crew pairing problems by column generation with an application to air transportation
- A probabilistic heuristic for a computationally difficult set covering problem
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
Cited in
(49)- Computational experience with general cutting planes for the set covering problem
- Model-based view planning
- Heuristics for the variable sized bin-packing problem
- An adaptation of SH heuristic to the location set covering problem
- Simple Lagrangian heuristic for the set covering problem
- On some difficult linear programs coming from set partitioning
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- Improved handling of uncertainty and robustness in set covering problems
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Covering models and optimization techniques for emergency response facility location and planning: a review
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Efficient feature selection for logical analysis of large-scale multi-class datasets
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- Column generation extensions of set covering greedy heuristics
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- An improved configuration checking-based algorithm for the unicost set covering problem
- 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
- Primal convergence from dual subgradient methods for convex optimization
- Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Constrained 0-1 quadratic programming: basic approaches and extensions
- 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
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A hybrid heuristic for the set covering problem
- A heuristic algorithm for the set covering problem
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- A Heuristic Method for the Set Covering Problem
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
- An efficient mean field approach to the set covering problem
- Matheuristics: survey and synthesis
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- A binary monkey search algorithm variation for solving the set covering problem
- A meta-heuristic extension of the Lagrangian heuristic framework
- An exact algorithm for the minimum gap graph partitioning problem
- Exploring further advantages in an alternative formulation for the set covering problem
- An effective and simple heuristic for the set covering problem
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Surrogate constraint normalization for the set covering problem
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)
