Sciweavers

526 search results - page 9 / 106
» On the Number of Minimal Addition Chains
Sort
View
94
Voted
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
14 years 9 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
TYPES
2000
Springer
15 years 1 months ago
A Tour with Constructive Real Numbers
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Alberto Ciaffaglione, Pietro Di Gianantonio
EOR
2007
69views more  EOR 2007»
14 years 9 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
TON
2002
99views more  TON 2002»
14 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
GLOBECOM
2010
IEEE
14 years 7 months ago
Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
Frédéric Giroire, Julian Monteiro, S...