Sciweavers

19 search results - page 4 / 4
» Improved sorting-based procedure for integer programming
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
13 years 4 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
13 years 10 months ago
A Dynamic Multithreading Processor
We present an architecture that features dynamic multithreading execution of a single program. Threads are created automatically by hardware at procedure and loop boundaries and e...
Haitham Akkary, Michael A. Driscoll
COR
2008
111views more  COR 2008»
13 years 5 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
DLOG
2010
13 years 3 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev