Publication:4719183
From MaRDI portal
zbMath0936.65067MaRDI QIDQ4719183
No author found.
Publication date: 3 May 2000
nonlinear integer programming; numerical experiments; global minimization; interval branch-and-bound algorithm
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C30: Nonlinear programming
Related Items
An algorithm for nonlinear optimization problems with binary variables, Discrete global descent method for discrete global optimization and nonlinear integer programming, Discrete global optimization problems with a modified discrete filled function, A discrete dynamic convexized method for nonlinear integer programming, New tunnel-filled function method for discrete global optimization, Discrete filled function method for discrete global optimization, A new filled function method for nonlinear integer programming problem, Two-parameters quasi-filled function algorithm for nonlinear integer programming