Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes

Authors:
Marco Locatelli;Nguyen V. Thoai
Affiliations:
Universitá/ degli Studi di Firenze, Dipartimento di Sistemi e Informatica, Via di S.Marta, 3-50139 Firenze Italy/ University of Trier, Department of Mathematics, D-54286 Trier ...;Universitá/ degli Studi di Firenze, Dipartimento di Sistemi e Informatica, Via di S.Marta, 3-50139 Firenze Italy/
Venue:
Journal of Global Optimization
Year:
2000

Citing 7
Cited 6

Methods for global concave minimization: A bibliographic survey

SIAM Review
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Exhaustive nondegenerate conical processes for concave minimization on convex polytopes

Mathematics of Operations Research
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems

Computing
Normal conical algorithm for concave minimization over polytopes

Mathematical Programming: Series A and B
A Finite Algorithm for Global Minimization ofSeparable Concave Programs

Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

Journal of Global Optimization
A New Successive Partition Algorithm for Concave Minimization Based on Cone Decomposition and Decomposition Cuts

Journal of Global Optimization
Outlier detection and least trimmed squares approximation using semi-definite programming

Computational Statistics & Data Analysis
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints

SIAM Journal on Optimization
A Differential Evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization

Journal of Global Optimization
Bilevel time minimizing transportation problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper simplicial branch-and-bound algorithms for concave minimization problems are discussed. Some modifications of the basic algorithm are presented, mainly consisting in rules to start local searches, introduction of cuts and updates of the original objective function. While some of these tools are not new in the literature, it is the first time, to the authors' knowledge, that they are used to guarantee the finiteness of a simplicial branch-and-bound approach.