A Branch and Bound Method for Solving Integer Separable Concave Problems

Authors:
O. Barrientos;R. Correa;P. Reyes;A. Valdebenito
Affiliations:
Centro de Modelamiento Matemático, UMR Universidad de Chile-CNRS. Casilla 170/3, Correo 3, Santiago, Chile;Centro de Modelamiento Matemático, UMR Universidad de Chile-CNRS. Casilla 170/3, Correo 3, Santiago, Chile;Centro de Modelamiento Matemático, UMR Universidad de Chile-CNRS. Casilla 170/3, Correo 3, Santiago, Chile;Centro de Modelamiento Matemático, UMR Universidad de Chile-CNRS. Casilla 170/3, Correo 3, Santiago, Chile
Venue:
Computational Optimization and Applications
Year:
2003

Citing 3
Cited 1

Assignment methods incombinatorial data analysis

Assignment methods incombinatorial data analysis
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions

Journal of Global Optimization

Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems

Computational Intelligence and Security

Quantified Score

Hi-index	0.01

Visualization

Abstract

A branch and bound algorithm is proposed for solving integer separable concave problems. The method uses Lagrangian duality to obtain lower and upper bounds. We show that the dual program of a separable concave problem is a linear program. Moreover, we identify an excellent candidate to test on each region of the branch and we show an optimality sufficient condition for this candidate. Preliminary computational results are reported.