2976 search results - page 24 / 596 » On the bounded integer programming |
108
click to vote
ORL
2008
15 years 2 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
122
click to vote
AIPS
2011
14 years 6 months ago
2011
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
149
click to vote
CPAIOR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
147
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
121
click to vote
INFORMS
2010
15 years 24 days ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...