Thinner is not Always Better: Cascade Knapsack Problems
Optimization and Control
2016-12-28 v1
Abstract
In the context of branch-and-bound (B&B) for integer programming (IP) problems, a direction along which the polyhedron of the IP has minimum width is termed a thin direction. We demonstrate that a thin direction need not always be a good direction to branch on for solving the problem efficiently. Further, the integer width, which is the number of B&B nodes created when branching on the direction, may also not be an accurate indicator of good branching directions.
Cite
@article{arxiv.1612.08588,
title = {Thinner is not Always Better: Cascade Knapsack Problems},
author = {Bala Krishnamoorthy},
journal= {arXiv preprint arXiv:1612.08588},
year = {2016}
}
Comments
A slightly shorter version appears in Operations Research Letters (2016)