A primal-dual simplex algorithm for bi-objective network flow problems.
Augusto EusébioJosé Rui FigueiraMatthias EhrgottPublished in: 4OR (2009)
Keyphrases
- bi objective
- simplex algorithm
- primal dual
- network simplex algorithm
- network flow problem
- linear programming
- multi objective
- linear programming problems
- network design problem
- minimum cost flow
- approximation algorithms
- efficient solutions
- network design
- convex optimization
- linear program
- multiple objectives
- convergence rate
- interior point methods
- minimum cost
- ant colony optimization
- multi objective optimization
- semidefinite programming
- np hard
- simplex method
- knapsack problem
- interior point
- network flow
- shortest path problem
- objective function
- routing problem
- special case
- minimal cost
- mathematical model
- shortest path
- worst case