Sancho N.G.F.

N.G.F. Sancho

Information about the author N.G.F. Sancho will soon be added to the site.
Found 6 papers in total
Shortest-path problems with time windows on nodes and arcs
Shortest-path problems with time windows on nodes and arcs
1994
A dynamic programming formulation of a shortest path problem is presented when there...
The hierarchical network design problem with multiple primary paths
The hierarchical network design problem with multiple primary paths
1997
In this paper we develop a suboptimal solution for the hierarchical network design...
A suboptimal solution to a hierarchial network design problem using dynamic programming
A suboptimal solution to a hierarchial network design problem using dynamic programming
1995
Each arc of a network has two nonnegative costs. The primary cost is larger than the...
Partial solution of eigenproblems by a decomposition method-1. Theory
Partial solution of eigenproblems by a decomposition method-1. Theory
1995
This paper demonstrates the feasibility of using a recently developed technique, the...
Optimal routing with capacity, reliability and cost constraints
Optimal routing with capacity, reliability and cost constraints
1990
This paper considers a graph G in a network in which each arc ( i,j) is weighted with...
Dynamic programming, reduction of dimensionality and eigenvalue problems-II. Multidimensional case
Dynamic programming, reduction of dimensionality and eigenvalue problems-II. Multidimensional case
1990
Dynamic programming as used in most optimal control applications relies heavily on the...
Papers per page: