On a parametric shortest path problem from primal - dual multicommodity network optimization.
George G. PolakPublished in: Networks (1992)
Keyphrases
- primal dual
- shortest path problem
- linear programming
- network flow
- single source
- multiple objectives
- saddle point
- shortest path
- interior point methods
- network design
- affine scaling
- linear programming problems
- linear program
- convex optimization problems
- algorithm for linear programming
- convex programming
- interior point algorithm
- convex optimization
- combinatorial optimization problems
- interval data
- optimization problems
- semidefinite programming
- convergence rate
- approximation algorithms
- variational inequalities
- simplex method
- semidefinite
- optimal solution
- simplex algorithm
- optimization algorithm
- quadratic programming
- interior point
- search algorithm
- constrained optimization
- multi source