<--- Back to Details
First PageDocument Content
NP-complete problems / Analysis of algorithms / Algorithm / Mathematical logic / Travelling salesman problem / Logistics / Symmetry in mathematics / Time complexity / Vehicle routing problem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2013-01-15 22:34:44
NP-complete problems
Analysis of algorithms
Algorithm
Mathematical logic
Travelling salesman problem
Logistics
Symmetry in mathematics
Time complexity
Vehicle routing problem
Theoretical computer science
Computational complexity theory
Applied mathematics

Exploiting symmetries in logistics distribution planning

Add to Reading List

Source URL: www.mssanz.org.au

Download Document from Source Website

File Size: 1,16 MB

Share Document on Facebook

Similar Documents

A joint routing and speed optimization problem Ricardo Fukasawa∗, Qie He†, Fernando Santos‡, Yongjia Song§ Abstract Vehicle speed plays a significant role on fuel consumption and greenhouse gas emissions in freigh

DocID: 1t3jv - View Document

A branch-cut-and-price algorithm for the energy minimization vehicle routing problem Ricardo Fukasawa∗, Qie He†, Yongjia Song‡ August 25, 2014 Abstract

DocID: 1sVwb - View Document

RTGThe Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty Wolfram Wiesemann September 23rd 2015 TU Dortmund, HG 1, HS 3

DocID: 1sOqr - View Document

RTGMin-max-min Robust Optimization for the Capacitated Vehicle Routing Problem Jannis Kurtz, Lars Eufinger

DocID: 1snvE - View Document

RTGThe Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty Wolfram Wiesemann September 23rd 2015 TU Dortmund, HG 1, HS 3

DocID: 1rgX3 - View Document