Some branch and bound techniques for nonlinear optimization

DOI10.1007/BF01589399zbMath0639.90078OpenAlexW1999926325MaRDI QIDQ1100098

B. George

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589399

zbMATH Keywords

nonlinear optimizationBranch and Boundspecial ordered setsautomatic interpolation of new variablesChains of Linked Ordered Setspost-optimal Lagrangian relaxationsuccession of linear subproblems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Linear programming (90C05)

Related Items (8)

A nested layered network model for parallel solutions of discrete SPPs ⋮ A new approach to stochastic programming problems: Discrete model ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ Integrated supply chain scheduling of procurement, production, and distribution under spillover effects ⋮ Polynomial-time approximation algorithms for anchor-free TDoA localization ⋮ Solving integer programs with a few important binary gub constraints ⋮ Branch and bound with estimation based on pseudo-shadow-prices

Uses Software

• SCICONIC

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Global optimization using special ordered sets
• Unnamed Item

This page was built for publication: Some branch and bound techniques for nonlinear optimization