Enhancing an algorithm for set covering problems
From MaRDI portal
(Redirected from Publication:1194745)
Recommendations
Cites work
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A network relaxation based enumeration algorithm for set partitioning
- A probabilistic heuristic for a computationally difficult set covering problem
- An algorithm for set covering problem
- An algorithm for solving large capacitated warehouse location problems
- An Analysis of Private and Public Sector Location Models
- 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
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 3211377 (Why is no real title available?)
- scientific article; zbMATH DE number 3236615 (Why is no real title available?)
- Multi-Commodity Disconnecting Sets
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- 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 set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Optimal Political Districting by Implicit Enumeration Techniques
- Optimal Scheduiing of Two Consecutive Idle Periods
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Set Covering and Involutory Bases
- Set Covering and Involutory Bases
- Set Covering by an All Integer Algorithm
- Simplification of the Covering Problem with Application to Boolean Expressions
- The Location of Emergency Service Facilities
- Zero-one programming using non-binary tree-search
Cited in
(32)- Computational experience with general cutting planes for the set covering 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
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
- A parallel genetic algorithm to solve the set-covering problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A binary cat swarm optimization algorithm for the non-unicost set covering problem
- An algorithm for set covering problem
- Solving hard set covering problems
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Matrix formulation of EISs of graphs and its application to WSN covering problems
- Allocating costs in set covering problems
- An improved configuration checking-based algorithm for the unicost set covering problem
- Humanitarian logistics planning for natural disaster response with Bayesian information updates
- 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
- A fast approximation algorithm for solving the complete set packing problem
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A multi-objective model for locating search and rescue boats
- Solving a bicriteria problem of optimal service centers location
- A hybrid heuristic for the set covering problem
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- Set covering approach for reconstruction of sibling relationships
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- An optimal algorithm for variable knockout problems
- Exploring further advantages in an alternative formulation for the set covering problem
- An effective and simple heuristic for the set covering problem
- A GRASP algorithm to solve the unicost set covering problem
This page was built for publication: Enhancing an algorithm for set covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194745)
