Sciweavers

1274 search results - page 149 / 255
» N-fold integer programming
Sort
View
JNW
2006
98views more  JNW 2006»
13 years 10 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
EOR
2007
89views more  EOR 2007»
13 years 10 months ago
Managing a portfolio of long term service agreements
Long-term service agreements (LTSA) for the maintenance of capital-intensive equipment such as gas turbines and aircraft engines are gaining wide acceptance. A typical LTSA contra...
Srinivas Bollapragada, Aparna Gupta, Chaipat Lawsi...
NETWORKS
2008
13 years 10 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
FMSD
2007
97views more  FMSD 2007»
13 years 10 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
MP
2006
78views more  MP 2006»
13 years 10 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük