Sciweavers

74 search results - page 12 / 15
» Decomposing Linear Programs for Parallel Solution
Sort
View
GLOBECOM
2010
IEEE
13 years 5 months ago
Column Generation for Dimensioning Resilient Optical Grid Networks with Relocation
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...
Brigitte Jaumard, Jens Buysse, Ali Shaikh, Marc De...
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
GRID
2008
Springer
13 years 8 months ago
Dynamic scheduling for heterogeneous Desktop Grids
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
Issam Al-Azzoni, Douglas G. Down
JPDC
2007
96views more  JPDC 2007»
13 years 7 months ago
Optimal pipeline decomposition and adaptive network mapping to support distributed remote visualization
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
Mengxia Zhu, Qishi Wu, Nageswara S. V. Rao, S. Sit...
CP
2005
Springer
14 years 1 months ago
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