First Page | Document Content | |
---|---|---|
Date: 2015-02-11 08:09:39Graph theory Operations research Mathematics Computational complexity theory Network flow NP-complete problems NP-hard problems Travelling salesman problem Multi-commodity flow problem Flow network | TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery ProblemsAdd to Reading ListSource URL: www.ads.tuwien.ac.atDownload Document from Source WebsiteFile Size: 358,28 KBShare Document on Facebook |