Righini Giovanni

Giovanni Righini

Information about the author Giovanni Righini will soon be added to the site.
Found 23 papers in total
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
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...
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 column generation algorithm for the vehicle routing problem with soft time windows
A column generation algorithm for the vehicle routing problem with soft time windows
2011
The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set...
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 computational evaluation of a general branch-and-price framework for capacitated network location problems
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...
New dynamic programming algorithms for the resource constrained elementary shortest path problem
New dynamic programming algorithms for the resource constrained elementary shortest path problem
2008
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing...
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...
Solving the swath segment selection problem through Lagrangean relaxation
Solving the swath segment selection problem through Lagrangean relaxation
2008
The swath segment selection problem (SSSP) is an NP -hard combinatorial optimization...
Computational approaches to a combinatorial optimization problem arising from text classification
Computational approaches to a combinatorial optimization problem arising from text classification
2007
We present a combinatorial optimization problem with a particular cost structure: a...
A branch-and-price algorithm for the multilevel generalized assignment problem
A branch-and-price algorithm for the multilevel generalized assignment problem
2006
The multilevel generalized assignment problem (MGAP) is a variation of the generalized...
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
2007
The vehicle routing problem with simultaneous pick-up and delivery is the problem of...
A branch-and-price algorithm for the multi-source Weber problem
A branch-and-price algorithm for the multi-source Weber problem
2007
We present a branch-and-price algorithm for the exact solution of the multi-source...
A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection
A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection
2006
The vehicle routing problem with simultaneous distribution and collection is the...
An optimization algorithm for a penalized knapsack problem
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...
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
2006
When vehicle routing problems with additional constraints, such as capacity or time...
A branch-and-price algorithm for the capacitated p-median problem
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...
A note on the approximation of the asymmetric traveling salesman problem
A note on the approximation of the asymmetric traveling salesman problem
2004
We show that some asymmetric traveling salesman problem (ATSP) instances are...
Modeling and optimizing dynamic dial-a-ride problems
Modeling and optimizing dynamic dial-a-ride problems
2001
Dial-a-ride is an emerging alternative to traditional public transportation systems....
Data-dependent bounds for the general and the asymmetric stacker–crane problems
Data-dependent bounds for the general and the asymmetric stacker–crane problems
1999
The Stacker–Crane Problem (SCP) is a sequencing problem, arising in scheduling...
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
1995
Two algorithms are presented for the asymmetric travelling salesman problem. The worst...
A double annealing algorithm for discrete location/allocation problems
A double annealing algorithm for discrete location/allocation problems
1995
Many algorithms inspired by the simulated annealing paradigm for approximately solving...
Annealing algorithms for multisource absolute location problems on graph
Annealing algorithms for multisource absolute location problems on graph
1997
A methodology is presented for applying annealing techniques to multisource absolute...
Neural nets model for combinatorial optimization
Neural nets model for combinatorial optimization
1992
Neural nets are a strongly inderdisciplinary research field. Therefore it seems useful...
Papers per page: