Monaci Michele

Michele Monaci

Information about the author Michele Monaci will soon be added to the site.
Found 16 papers in total
Theoretical and computational results about optimality-based domain reductions
Theoretical and computational results about optimality-based domain reductions
2016
In this paper we discuss optimality‐based domain reductions for Global...
Backdoor Branching
Backdoor Branching
2013
We present an exact mixed‐integer programming (MIP) solution scheme where a...
Efficient Two‐Dimensional Packing Algorithms for Mobile WiMAX
Efficient Two‐Dimensional Packing Algorithms for Mobile WiMAX
2011
We present the result of research, developed within Nokia Siemens Networks, to solve...
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
2012
A recent paper (Davidović et al., J. Heuristics, 18:549–569, 2012)...
Branching on nonchimerical fractionalities
Branching on nonchimerical fractionalities
2012
We address methods for selecting the branching variable in an enumerative algorithm...
Exact algorithms for the two‐dimensional guillotine knapsack
Exact algorithms for the two‐dimensional guillotine knapsack
2012
The two‐dimensional knapsack problem requires to pack a maximum profit subset...
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
2008
Given a set of jobs with associated processing times, and a set of identical machines,...
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)...
How tight is the corner relaxation?
How tight is the corner relaxation?
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the...
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006
We address the problem of packing a given set of rectangles into the minimum size...
Lower bounds and heuristic algorithms for the ki-partitioning problem
Lower bounds and heuristic algorithms for the ki-partitioning problem
2006
We consider the problem of partitioning a set of positive integers values into a given...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003
We consider the problem of orthogonally packing a given set of rectangular items into...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006
Several combinatorial optimization problems can be formulated as large set-covering...
Fast approximation schemes for two-stage, two-dimensional bin packing
Fast approximation schemes for two-stage, two-dimensional bin packing
2005
We present an asymptotic fully polynomial time approximation scheme for the...
On the two-dimensional Knapsack problem
On the two-dimensional Knapsack problem
2004
We address the two-dimensional Knapsack Problem (2KP), aimed at packing a...
Two-dimensional packing problems: A survey
Two-dimensional packing problems: A survey
2002
We consider problems requiring to allocate a set of rectangular items to larger...
Papers per page: