Lodi Andrea

Andrea Lodi

Information about the author Andrea Lodi will soon be added to the site.
Found 26 papers in total
On learning and branching: a survey
On learning and branching: a survey
2017
This paper surveys learning techniques to deal with the two most crucial decisions in...
Needs forecast and fund allocation of medical specialty positions in Emilia-Romagna (Italy) by system dynamics and integer programming
Needs forecast and fund allocation of medical specialty positions in Emilia-Romagna (Italy) by system dynamics and integer programming
2016
Each year Emilia‐Romagna health managers have to negotiate the number of...
On the difficulty of virtual private network instances
On the difficulty of virtual private network instances
2014
The virtual private network design problem has attracted an impressive number of...
Mixed integer nonlinear programming tools: an updated practical overview
Mixed integer nonlinear programming tools: an updated practical overview
2013
We present a review of available tools for solving mixed integer nonlinear programming...
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...
Bounding, filtering and diversification in CP‐based local branching
Bounding, filtering and diversification in CP‐based local branching
2012
Local branching is a general purpose heuristic method which searches locally around...
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...
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
2008
We study the classical capacitated multi–item lot–sizing problem with hard...
Discrepancy-based additive bounding procedures
Discrepancy-based additive bounding procedures
2006
We model portions of the search tree via so–called search constraints. We focus...
Polynomial-time separation of a superclass of simple comb inequalities
Polynomial-time separation of a superclass of simple comb inequalities
2006
The comb inequalities are a well–known class of facet–inducing...
An algorithmic framework for convex mixed integer nonlinear programs
An algorithmic framework for convex mixed integer nonlinear programs
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an...
A feasibility pump heuristic for general mixed-integer problems
A feasibility pump heuristic for general mixed-integer problems
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very...
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...
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...
TSpack: A unified tabu search code for multi-dimensional bin packing problems
TSpack: A unified tabu search code for multi-dimensional bin packing problems
2004
We present a computer code that implements a general Tabu Search technique for the...
Primal separation algorithms
Primal separation algorithms
2003
Given an integer polyhedron P I ⊂ ℝ n , an integer point &xmacr; ∈ P I ,...
Models and bounds for two-dimensional level packing problems
Models and bounds for two-dimensional level packing problems
2004
We consider two-dimensional bin packing and strip packing problems where the items...
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
2002
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a...
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
2001
Crew and vehicle scheduling are fundamental issues in public transit management....
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...
Heuristic algorithms for the three-dimensional bin packing problem
Heuristic algorithms for the three-dimensional bin packing problem
2002
The Three-dimensional Bin Packing Problem (3BP) consists of allocating, without...
Mathematical programming techniques in constraint programming: A short overview
Mathematical programming techniques in constraint programming: A short overview
2002
In recent years, the integration of techniques from Artificial Intelligence and...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
Exact and heuristic algorithms for data sets reconstruction
Exact and heuristic algorithms for data sets reconstruction
2000
Given a data set defined by n samples, the Data set Reconstruction Problem (DRP)...
Papers per page: