Pages that link to "Item:Q1278326"
From MaRDI portal
The following pages link to A genetic algorithm for the set covering problem (Q1278326):
Displaying 50 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran (Q264250) (← links)
- Hierarchical differential evolution for minimal cut sets identification: application to nuclear safety systems (Q296832) (← links)
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network (Q531449) (← links)
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems (Q540668) (← links)
- Location and design decisions of facilities in a distribution system with elastic customer demand (Q615250) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- Minimizing fleet operating costs for a container transportation company (Q819069) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil (Q863989) (← links)
- The bi-objective covering tour problem (Q868132) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Model-based view planning (Q1008495) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Fuzzy minimum weight edge covering problem (Q1031614) (← links)
- An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- An indirect genetic algorithm for a nurse-scheduling problem (Q1433170) (← links)
- Fuzzy dispatching model and genetic algorithms for railyards operations (Q1577766) (← links)
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem (Q1579122) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study (Q1847206) (← links)
- Application of heuristic methods for conformance test selection (Q1847243) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Application of a hybrid genetic algorithm to airline crew scheduling (Q1915974) (← links)
- Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
