A hybrid soft computing approach for subset problems
From MaRDI portal
Publication:474017
DOI10.1155/2013/716069zbMath1299.90392OpenAlexW2111036727WikidataQ57782135 ScholiaQ57782135MaRDI QIDQ474017
Wenceslao Palma, Broderick Crawford, Carlos Castro, Fernando Paredes, Eric Monfroy, Ricardo L. Soto
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/716069
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
A depth-based heuristic to solve the multi-objective influence spread problem using particle swarm optimization ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ A bicriteria approach identifying nondominated portfolios
Cites Work
- A probabilistic heuristic for a computationally difficult set covering problem
- Consistency in networks of relations
- On some difficult linear programs coming from set partitioning
- Backjump-based backtracking for constraint satisfaction problems
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- Constraint handling in genetic algorithms: the set partitioning problem
- VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A Set Partitioning Approach to the Crew Scheduling Problem
This page was built for publication: A hybrid soft computing approach for subset problems
