Bettinelli Andrea

Andrea Bettinelli

Information about the author Andrea Bettinelli will soon be added to the site.
Found 5 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...
The Anonymous Subgraph Problem
The Anonymous Subgraph Problem
2013
In this work we address the Anonymous Subgraph Problem (ASP). The problem asks to...
A branch‐and‐cut‐and‐price algorithm for the multi‐depot heterogeneous vehicle routing problem with time windows
A branch‐and‐cut‐and‐price algorithm for the multi‐depot heterogeneous vehicle routing problem with time windows
2011
We present a branch‐and‐cut‐and‐price algorithm for the...
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
2010
In this paper we consider a variation of the bin packing problem in which bins of...
A branch-and-price algorithm for the two-dimensional level strip packing problem
A branch-and-price algorithm for the two-dimensional level strip packing problem
2008
The two–dimensional level strip packing problem (2LSPP) consists in packing...
Papers per page: