Trivial integer programs unsolvable by branch-and-bound
- 1 December 1974
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 6 (1) , 105-109
- https://doi.org/10.1007/bf01580225
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On algorithms for discrete problemsDiscrete Mathematics, 1974
- The simplex algorithm with the pivot rule of maximizing criterion improvementDiscrete Mathematics, 1973
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- On an Algorithm of GomorySIAM Journal on Applied Mathematics, 1971
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Discrete Programming by the Filter MethodOperations Research, 1967
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960