Scatter search for the bandpass problem
From MaRDI portal
Publication:524910
DOI10.1007/s10898-016-0446-0zbMath1369.90150OpenAlexW2418725752MaRDI QIDQ524910
Jesús Sánchez-Oro, Rafael Martí, Manuel Laguna, Abraham Duarte
Publication date: 27 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0446-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Scatter search for the minimum leaf spanning tree problem, An iterated greedy algorithm for finding the minimum dominating set in graphs, Scatter search for the bandpass problem, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, The band collocation problem
Uses Software
Cites Work
- Unnamed Item
- Scatter search for the bandpass problem
- Hybrid scatter tabu search for unconstrained global optimization
- On the bandpass problem
- Mathematical models of the bandpass problem and OrderMatic computer game
- The three column bandpass problem is solvable in linear time
- Tabu search and GRASP for the maximum diversity problem
- The bandpass problem: Combinatorial optimization and library of problems
- GRASP and path relinking for the max-min diversity problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Variable neighborhood search
- Scatter search for the cutwidth minimization problem
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Hybrid heuristics for the maximum diversity problem
- Advanced Scatter Search for the Max-Cut Problem