Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems.
Dalila B. M. M. FontesEleni HadjiconstantinouNicos ChristofidesPublished in: J. Glob. Optim. (2006)
Keyphrases
- lower bound
- network flow problem
- minimum cost
- state space
- np hard
- minimal cost
- fixed charge
- objective function
- branch and bound
- upper bound
- network design problem
- branch and bound algorithm
- network simplex algorithm
- transportation problem
- optimal solution
- network flow
- reinforcement learning
- feasible solution
- worst case
- approximation algorithms
- dynamical systems
- search space
- dynamic programming
- integer programming
- lower and upper bounds
- optimization problems
- network design
- total cost
- linear programming
- markov decision processes
- heuristic search
- exact solution
- lagrangian relaxation
- linear programming relaxation
- knapsack problem
- endpoints
- expected cost
- fixed cost
- constraint satisfaction problems