2976 search results - page 1 / 596 » On the bounded integer programming |
RIVF
2008
13 years 5 months ago
2008
The best upper time bound for solving the Bounded Integer Programming (BIP) up to now is poly()
EOR
2006
13 years 4 months ago
2006
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
CPAIOR
2007
Springer
13 years 10 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
ANOR
2007
13 years 4 months ago
2007
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...