Pages that link to "Item:Q1194745"
From MaRDI portal
The following pages link to Enhancing an algorithm for set covering problems (Q1194745):
Displaying 27 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A multi-objective model for locating search and rescue boats (Q323331) (← links)
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- A genetic algorithm for the set covering problem (Q1278326) (← links)
- Simple Lagrangian heuristic for the set covering problem (Q1278602) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Matrix formulation of EISs of graphs and its application to WSN covering problems (Q2036024) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Humanitarian logistics planning for natural disaster response with Bayesian information updates (Q2438394) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
