Search

Now showing items 1-10 of 12

A Branch-and-cut Algorithm for the Undirected Rural Postman Problem

Type: Ebook

Author : Ghiani G.; Laporte G.

Year: 2000

Introduction to logistics systems planning and control

Type: Ebook

Author : Ghiani G.; Laporte G.; Musmanno R.

Publisher: Wiley

Year: 2004

Request PDF

The Dynamic Uncapacitated Hub Location Problem

Type: Journal Paper

Author : Contreras, I.; Cordeau, J.-F.; Laporte, G.

Year: 2011

Request PDF

Introduction to Logistics Systems Planning and Control

Type: Ebook

Author : Ghiani G.; Laporte G.; Musmanno R.

Year: 2004

Request PDF

Benders Decomposition for Large-Scale Uncapacitated Hub Location

Type: Journal Paper

Author : Contreras, I.; Cordeau, J.-F.; Laporte, G.

Publisher: INFORMS

Year: 2011

Request PDF

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

Type: Journal Paper

Author : Jozefowiez, N.; Laporte, G.; Semet, F.

Publisher: INFORMS

Year: 2012

Request PDF

An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Type: Journal Paper

Author : Laporte, G.; Musmanno, R.; Vocaturo, F.

Year: 2010

Request PDF

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

Type: Journal Paper

Author : Cordeau, J-F; Laporte, G; Mercier, A

Year: 2004

Request PDF

Robust Inventory Routing Under Demand Uncertainty

Type: Journal Paper

Author : Solyali, O.; Cordeau, J.-F.; Laporte, G.

Year: 2012

Request PDF

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

Type: Journal Paper

Author : Archetti, C.; Bertazzi, L.; Laporte, G.; Speranza, M. G.

Publisher: INFORMS

Year: 2007

Request PDF

Search

A Branch-and-cut Algorithm for the Undirected Rural Postman Problem

Introduction to logistics systems planning and control

The Dynamic Uncapacitated Hub Location Problem

Introduction to Logistics Systems Planning and Control

Benders Decomposition for Large-Scale Uncapacitated Hub Location

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

Robust Inventory Routing Under Demand Uncertainty

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

Author

Subject

Publisher

Year

Type

Language (ISO)

Content Type

Publication Title

Search

Filters

A Branch-and-cut Algorithm for the Undirected Rural Postman Problem

Introduction to logistics systems planning and control

The Dynamic Uncapacitated Hub Location Problem

Introduction to Logistics Systems Planning and Control

Benders Decomposition for Large-Scale Uncapacitated Hub Location

A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

Robust Inventory Routing Under Demand Uncertainty

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem