A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems

DOI10.1007/BF01941144zbMath0657.65082MaRDI QIDQ1110993

Frank Koerner

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

integer programmingnumerical examplesbranch and bound algorithmdual solutionnonlinear function minimizationreal imbedding

Mathematics Subject Classification ID

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

Related Items (7)

Solving mixed integer nonlinear programs by outer approximation ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ Logarithmic-exponential penalty formulation for integer programming ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ On duality for Boolean programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer quadratic optimization
• Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Methods of Nonlinear 0-1 Programming
• Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren
• Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme
• Trivial integer programs unsolvable by branch-and-bound
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

This page was built for publication: A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems