Algorithms for large scale set covering problems
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09) Combinatorial optimization (90C27)
Recommendations
- A heuristic algorithm for the set covering problem
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- An algorithm for set covering problem
- Solving large set covering problems on a personal computer
Cites work
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Greedy Heuristic for the Set-Covering Problem
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A network relaxation based enumeration algorithm for set partitioning
- A Partitioning Problem with Applications in Regional Design
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithms for large scale set covering problems
- An Integer Programming Approach to the Vehicle Scheduling Problem
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Calculating surrogate constraints
- Covering-Location Models for Emergency Situations That Require Multiple Response Units
- Cutting planes from conditional bounds: A new approach to set covering
- Dynamic versions of set covering type public facility location problems
- scientific article; zbMATH DE number 3520170 (Why is no real title available?)
- Note—A Computational Survey of Methods for the Set Covering Problem
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Set Covering and Involutory Bases
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Set Partitioning: A survey
- Simplification of the Covering Problem with Application to Boolean Expressions
- Solving large set covering problems on a personal computer
- Some relationships between Lagrangian and surrogate duality in integer programming
- State-space relaxation procedures for the computation of bounds to routing problems
- The Backboard Wiring Problem: A Placement Algorithm
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Zero-one programming using non-binary tree-search
Cited in
(33)- Solving large set covering problems on a personal computer
- A structural Lagrangean relaxation for two-duty period bus driver scheduling problems
- The multicovering problem
- An adaptation of SH heuristic to the location set covering problem
- Computational experience with approximation algorithms for the set covering problem
- Algorithms for large scale set covering problems
- State space relaxation for set covering problems related to bus driver scheduling
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Solving large set covering problems for crew scheduling
- Graph theoretic relaxations of set covering and set partitioning problems
- A neural network for the minimum set covering problem
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- An algorithm for set covering problem
- Improving set partitioning problem solutions by zooming around an improving direction
- A 3-flip neighborhood local search for the set covering problem
- Lower bounds from state space relaxations for concave cost network flow problems
- Spatial and objective decompositions for very large SCAPs
- Solving set covering problems of large dimension
- A nested decomposition approach for a large scale set covering problem: a model with a variety of applications in Industry 4.0
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- A decomposition algorithm for linear relaxation of the weigted r-covering problem
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- scientific article; zbMATH DE number 4106856 (Why is no real title available?)
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
- scientific article; zbMATH DE number 1984140 (Why is no real title available?)
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Benchmark data set with service programs to approximately solve the set covering problem
- Algorithms for the set covering problem
- An efficient mean field approach to the set covering problem
- Using a facility location algorithm to solve large set covering problems
- Solution techniques for the large set covering problem
This page was built for publication: Algorithms 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 Q1309874)