Sciweavers

210 search results - page 31 / 42
» Error bounds for mixed integer linear optimization problems
Sort
View
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
JCO
2000
116views more  JCO 2000»
14 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
QSHINE
2005
IEEE
15 years 3 months ago
Link Scheduling with Power Control for Throughput Enhancement in Multihop Wireless Networks
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
ICTAI
1999
IEEE
15 years 1 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman