Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
From MaRDI portal
Publication:4170529
DOI10.1080/02331937708842455zbMath0388.90048OpenAlexW2046956992MaRDI QIDQ4170529
No author found.
Publication date: 1977
Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331937708842455
Convex programming (90C25) Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (4)
A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems ⋮ A hybrid method for solving nonlinear knapsack problems ⋮ An efficient branch and bound algorithm to solve the quadratic integer programming problem ⋮ On duality for Boolean programming
This page was built for publication: Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
