<--- Back to Details
First PageDocument 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
Date: 2015-02-11 08:09:39
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

Source URL: www.ads.tuwien.ac.at

Download Document from Source Website

File Size: 358,28 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document