An algorithmic framework for convex mixed integer nonlinear programs

An algorithmic framework for convex mixed integer nonlinear programs

0.00 Avg rating0 Votes
Article ID: iaor20091383
Country: Netherlands
Volume: 5
Issue: 2
Start Page Number: 186
End Page Number: 204
Publication Date: May 2008
Journal: Discrete Optimization
Authors: , , , , , , , , , ,
Keywords: programming: branch and bound
Abstract:

This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving large-scale problems. Moreover, both fundamental building blocks, namely mixed integer linear programming and nonlinear programming, have seen considerable and steady progress in recent years. Wishing to exploit expertise in these areas as well as on previous work in mixed integer nonlinear programming, this work represents the first step in an ongoing and ambitious project within an open-source environment.

Reviews

Required fields are marked *. Your email address will not be published.