Optimisation of large scale network problems

Optimisation of large scale network problems

The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved in polynomial time; with them, the CSPP is NP-hard and thus far no polynomial-t...

Full description

Bibliographic Details
Main Author: Grigoleit, Mark Ted
Format: Thesis
Language:English
Published: Curtin University 2008
Subjects:
large grid networks
random valued network
Lagrange relaxation
Constraint programming
Constrained Shortest Path Problem (CSPP)
submarine transit path problem
single side constraint
Online Access:http://hdl.handle.net/20.500.11937/1405

Internet

http://hdl.handle.net/20.500.11937/1405

Similar Items