2976 search results - page 56 / 596 » On the bounded integer programming |
GD
2003
Springer
14 years 3 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
STOC
1989
ACM
14 years 2 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
COCOA
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
MOC
1998
13 years 9 months ago
1998
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
ESA
2006
Springer
14 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...