Sciweavers

327 search results - page 46 / 66
» Cutting planes in integer and mixed integer programming
Sort
View
IOR
2007
106views more  IOR 2007»
15 years 1 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
CCE
2005
15 years 1 months ago
Wastewater minimisation using central reusable water storage in batch plants
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
Thokozani Majozi
TROB
2010
129views more  TROB 2010»
14 years 11 months ago
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
Lars Blackmore, Masahiro Ono, Askar Bektassov, Bri...
DAC
2006
ACM
16 years 2 months ago
Simultaneous time slack budgeting and retiming for dual-Vdd FPGA power reduction
Field programmable dual-Vdd interconnects are effective to reduce FPGA power. Assuming uniform length interconnects, existing work has developed time slack budgeting to minimize p...
Yu Hu, Yan Lin, Lei He, Tim Tuan
109
Voted
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 11 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv