Back to Results
First PageMeta Content
Graph 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 Problems
Add to Reading List

Document Date: 2015-02-11 08:09:39

Open Document

File Size: 358,28 KB

Share Result on Facebook
UPDATE