Sciweavers

6315 search results - page 1131 / 1263
» Approximating Solution Structure
Sort
View
EOR
2007
69views more  EOR 2007»
13 years 10 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
JVCA
2006
140views more  JVCA 2006»
13 years 10 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
MP
2006
110views more  MP 2006»
13 years 10 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
OSN
2008
83views more  OSN 2008»
13 years 10 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
PUC
2006
72views more  PUC 2006»
13 years 10 months ago
Towards self-protecting ubiquitous systems: monitoring trust-based interactions
The requirement for spontaneous interaction in ubiquitous computing creates security issues over and above those present in other areas of computing, deeming traditional approaches...
Colin English, Sotirios Terzis, Paddy Nixon
« Prev « First page 1131 / 1263 Last » Next »