A metaheuristic framework for nonlinear capacitated covering problems

DOI10.1007/S11590-015-0913-4MaRDI QIDQ5963698zbMATHOpenAlexFDO

Authors Enrico Malaguti, Rosa Medina Durán, 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

zbMATH Keywords

integer nonlinear programmingmetaheuristic algorithmcapacitated covering problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Heuristic approaches to the capacitated square covering problem
• The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
• Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
• An effective and simple heuristic for the set covering problem
• scientific article; zbMATH DE number 4121754

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• A metaheuristic approach for the vertex coloring problem
• A set-covering-based heuristic approach for bin-packing problems
• Models and heuristic algorithms for a weighted vertex coloring problem
• Staff scheduling and rostering: a review of applications, methods and models.

Cited in

(1)

• Lifting for the integer knapsack cover polyhedron

Describes a project that uses

Uses Software

• CPLEX
• VRP

This page was built for publication: A metaheuristic framework for nonlinear capacitated covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963698)