A meta-heuristic with orthogonal experiment for the set covering problem
From MaRDI portal
Publication:702766
DOI10.1023/B:JMMA.0000038619.69509.BFzbMath1146.90535OpenAlexW2036057022MaRDI QIDQ702766
Raymond S. K. Kwan, Jingpeng Li
Publication date: 17 January 2005
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jmma.0000038619.69509.bf
Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (4)
A genetic algorithm for public transport driver scheduling ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ Solving fuzzy linear fractional set covering problem by a goal programming based solution approach ⋮ An adaptive heuristic algorithm for VLSI test vectors selection
Uses Software
This page was built for publication: A meta-heuristic with orthogonal experiment for the set covering problem
