A metaheuristic framework for nonlinear capacitated covering problems
From MaRDI portal
Publication:5963698
DOI10.1007/s11590-015-0913-4zbMath1339.90284OpenAlexW2246606359MaRDI QIDQ5963698
Rosa Medina Durán, Enrico Malaguti, Paolo Toth
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0913-4
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Models and heuristic algorithms for a weighted vertex coloring problem
- Staff scheduling and rostering: a review of applications, methods and models.
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- A Metaheuristic Approach for the Vertex Coloring Problem
- A Linear Programming Approach to the Cutting-Stock Problem
This page was built for publication: A metaheuristic framework for nonlinear capacitated covering problems