Leonora Bianchi

According to our database, Leonora Bianchi authored at least 9 papers between 2002 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2009

A survey on metaheuristics for stochastic combinatorial optimization.

Leonora Bianchi, Marco Dorigo, Luca Maria Gambardella, Walter J. Gutjahr

Nat. Comput., 2009

New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem.

Dennis Weyland, Leonora Bianchi, Luca Maria Gambardella

Proceedings of the Computer Aided Systems Theory, 2009

2007

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem.

Leonora Bianchi, Ann Melissa Campbell

Eur. J. Oper. Res., 2007

2006

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands.

Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto

J. Math. Model. Algorithms, 2006

2005

Core instances for testing: A case study.

Monaldo Mastrolilli, Leonora Bianchi

Eur. J. Oper. Res., 2005

Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms.

Leonora Bianchi, Joshua D. Knowles, Neill Bowler

Eur. J. Oper. Res., 2005

2004

Applications Metaheuristics for the Vehicle Routing Problem with Stochastic Demands.

Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luís Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto

Proceedings of the Parallel Problem Solving from Nature, 2004

2002

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem.

Leonora Bianchi, Luca Maria Gambardella, Marco Dorigo

Proceedings of the Parallel Problem Solving from Nature, 2002

Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic.

Leonora Bianchi, Luca Maria Gambardella, Marco Dorigo

Proceedings of the Ant Algorithms, Third International Workshop, 2002