A branch-and-bound algorithm for the minimum cut linear arrangement problem.
Gintaras PalubeckisDalius RubliauskasPublished in: J. Comb. Optim. (2012)
Keyphrases
- branch and bound algorithm
- minimum cut
- lower bound
- maximum flow
- branch and bound
- upper bound
- combinatorial optimization
- optimal solution
- np hard
- graph cuts
- lagrangian relaxation
- weighted graph
- special case
- search space
- directed graph
- shortest path problem
- linear systems
- graph partitioning
- multiple objectives
- optimization problems
- simulated annealing
- computational complexity