Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren

1 January 1982

journal article
research article
Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization

Vol. 13 (2) , 221-229
https://doi.org/10.1080/02331938208842782

Abstract

A branch and bound algorithm for the nonlinear integer programming problem is investigated. A condition in which order the variables should be ramified to make the number of knots being studied to a minimum is given. The results obtained are discussed for the knapsack problem.

Keywords

This publication has 6 references indexed in Scilit:

Anwendungen der Linearen Parametrischen Optimierung
Published by Springer Nature ,1979
When the Greedy Solution Solves a Class of Knapsack Problems
Operations Research, 1975
Solution of Linear Integer programming Problems by Dynamic Programming
Mathematische Operationsforschung und Statistik, 1974
There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
Operations Research, 1973
Methoden der Ganzzahligen Optimierung
Published by Springer Nature ,1972
Diskrete Optimierung
Published by Walter de Gruyter GmbH ,1971