Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Alberto Ceselli
Information about the author Alberto Ceselli will soon be added to the site.
Found
10 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
2014
In this article, we consider a variation of the vehicle routing problem arising in the...
Column Generation for the Minimum Hyperplanes Clustering Problem
2013
Given n points in ℝ d and a maximum allowed tolerance ε > 0, the minimum...
Efficient algorithms for the double traveling salesman problem with multiple stacks
2012
In this paper we investigate theoretical properties of the Double Traveling Salesman...
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
2010
In this paper we consider a variation of the bin packing problem in which bins of...
A computational evaluation of a general branch-and-price framework for capacitated network location problems
2009
The purpose of this paper is to illustrate a general framework for network location...
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...
A branch-and-price algorithm for the multilevel generalized assignment problem
2006
The multilevel generalized assignment problem (MGAP) is a variation of the generalized...
An optimization algorithm for a penalized knapsack problem
2006
We study a variation of the knapsack problem in which each item has a profit, a weight...
A branch-and-price algorithm for the capacitated p-median problem
2005
The capacitated p -median problem is the variation of the well-known p -median problem...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers