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

DOI10.1080/02331938208842782zbMath0494.90054OpenAlexW2029461204MaRDI QIDQ3958272

Frank Koerner

Publication date: 1982

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938208842782

zbMATH Keywords

branch-and-bound algorithmnonlinear integer programmingknapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)

Related Items (3)

A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems ⋮ A hybrid method for solving nonlinear knapsack problems ⋮ Integer quadratic optimization

This page was built for publication: Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren