Almost optimum placement legalization by minimum cost flow and dynamic programming.
Ulrich BrennerAnna PauliJens VygenPublished in: ISPD (2004)
Keyphrases
- minimum cost flow
- dynamic programming
- network simplex algorithm
- bi objective
- shortest path
- strongly polynomial
- bipartite matching
- shortest path algorithm
- minimum cost
- knapsack problem
- linear programming
- single machine
- network design
- neural network
- greedy algorithm
- routing algorithm
- linear program
- scheduling problem
- np hard
- optimal solution