Sciweavers

2976 search results - page 19 / 596
» On the bounded integer programming
Sort
View
ANTS
1998
Springer
107views Algorithms» more  ANTS 1998»
15 years 11 months ago
Bounding Smooth Integers
Daniel J. Bernstein
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Tight Bounds for Blind Search on the Integers
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
140
Voted
ORL
2008
74views more  ORL 2008»
15 years 6 months ago
Bounds on the size of branch-and-bound proofs for integer knapsacks
Bala Krishnamoorthy
CP
2004
Springer
16 years 2 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
182
Voted
CPAIOR
2008
Springer
15 years 8 months ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...