Accelerating the B&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
This paper presents a new branching rule based on the flatness of a polyhedron associated to the set of constraints in an integer linear programming problem. The rule called Flatness II is a heuristic technique used with the branch-and-bound method. The rule is concerned with the minimum integer wid...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2017-01-01
|
| Series: | Croatian Operational Research Review |
| Online Access: | http://hrcak.srce.hr/file/267766 |