Sciweavers

89 search results - page 9 / 18
» Upper Bounds on the Number of Solutions of Binary Integer Pr...
Sort
View
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
ISPAN
2002
IEEE
14 years 9 days ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
AAAI
2012
11 years 9 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
CP
2009
Springer
14 years 2 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...