scientific article; zbMATH DE number 1383429

zbMath0936.65067MaRDI QIDQ4719183

No author found.

Publication date: 3 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

nonlinear integer programmingnumerical experimentsglobal minimizationinterval branch-and-bound algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (8)

Two-parameters quasi-filled function algorithm for nonlinear integer programming ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ New tunnel-filled function method for discrete global optimization ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ A new filled function method for nonlinear integer programming problem ⋮ An algorithm for nonlinear optimization problems with binary variables

This page was built for publication: