21 search results - page 2 / 5 » Branch and bound, integer, and non-integer programming |
INFORMS
2006
13 years 4 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
4OR
2006
13 years 4 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
SYNASC
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
DISOPT
2008
13 years 4 months ago
2008
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 f...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 8 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...