Malaguti Enrico

Enrico Malaguti

Information about the author Enrico Malaguti will soon be added to the site.
Found 8 papers in total
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
2017
We study the knapsack problem with conflict graph (KPCG), an extension of the...
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
2016
We propose a framework to model general guillotine restrictions in...
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
2013
We study a natural generalization of the knapsack problem, in which each item exists...
Exact weighted vertex coloring via branch‐and‐price
Exact weighted vertex coloring via branch‐and‐price
2012
We consider the Weighted Vertex Coloring Problem (WVCP), in which a positive weight is...
A Freight Service Design Problem for a Railway Corridor
A Freight Service Design Problem for a Railway Corridor
2011
We study the problem of designing a set of highly profitable freight routes in a...
Algorithms for the bin packing problem with conflicts
Algorithms for the bin packing problem with conflicts
2010
We consider a particular bin packing problem in which some pairs of items may be in...
A survey on vertex coloring problems
A survey on vertex coloring problems
2010
This paper surveys the most important algorithmic and computational results on the...
A Metaheuristic Approach for the Vertex Coloring Problem
A Metaheuristic Approach for the Vertex Coloring Problem
2008
Given an undirected graph G = ( V , E ), the vertex coloring problem (VCP)...
Papers per page: