Enhancing an algorithm for set covering problems
From MaRDI portal
Publication:1194745
DOI10.1016/0377-2217(92)90215-UzbMath0759.90070OpenAlexW2033405689MaRDI QIDQ1194745
Kurt O. Jørnsten, John E. Beasley
Publication date: 6 October 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90215-u
Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (29)
An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ A multi-objective model for locating search and rescue boats ⋮ An effective and simple heuristic for the set covering problem ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ Algorithms for railway crew management ⋮ Solving large set covering problems for crew scheduling ⋮ A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ Solving a bicriteria problem of optimal service centers location ⋮ A hybrid heuristic for the set covering problem ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ Allocating costs in set covering problems ⋮ Solving hard set covering problems ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ Humanitarian logistics planning for natural disaster response with Bayesian information updates ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ Set covering approach for reconstruction of sibling relationships ⋮ Matrix formulation of EISs of graphs and its application to WSN covering problems ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A fast approximation algorithm for solving the complete set packing problem ⋮ An adaptation of SH heuristic to the location set covering problem ⋮ A genetic algorithm for the set covering problem ⋮ Simple Lagrangian heuristic for the set covering problem ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles ⋮ A parallel genetic algorithm to solve the set-covering problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- An algorithm for solving large capacitated warehouse location problems
- On the integer properties of scheduling set partitioning models
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- A probabilistic heuristic for a computationally difficult set covering problem
- A network relaxation based enumeration algorithm for set partitioning
- An algorithm for set covering problem
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Multi-Commodity Disconnecting Sets
- An Analysis of Private and Public Sector Location Models
- Optimal Political Districting by Implicit Enumeration Techniques
- Simplification of the Covering Problem with Application to Boolean Expressions
- The Location of Emergency Service Facilities
- Zero-one programming using non-binary tree-search
- Set Covering and Involutory Bases
- Set Covering and Involutory Bases
- Optimal Scheduiing of Two Consecutive Idle Periods
- Set Covering by an All Integer Algorithm
This page was built for publication: Enhancing an algorithm for set covering problems
