scientific article; zbMATH DE number 1047684

zbMath0874.90163MaRDI QIDQ4347851

John E. Mitchell

Publication date: 11 August 1997

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

zbMATH Keywords

nonconvex quadratic programminginterior point algorithmsnetwork flowbranch and cut methods

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Interior-point methods (90C51) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems ⋮ SICOpt: Solution approach for nonlinear integer stochastic programming problems

This page was built for publication: