Finite exact branch-and-bound algorithms for concave minimization over polytopes
From MaRDI portal
Publication:5927657
DOI10.1023/A:1008324430471zbMath1001.90069OpenAlexW1574055584MaRDI QIDQ5927657
Marco Locatelli, Nguyen Van Thoai
Publication date: 13 May 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008324430471
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (11)
Combination of two underestimators for univariate global optimization ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Optimization Models in the Natural Gas Industry ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ Outlier detection and least trimmed squares approximation using semi-definite programming ⋮ A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization ⋮ Bilevel time minimizing transportation problem ⋮ Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ Two level hierarchical time minimizing transportation problem ⋮ Sufficient optimality criterion for linearly constrained, separable concave minimization problems
This page was built for publication: Finite exact branch-and-bound algorithms for concave minimization over polytopes
