Sciweavers

NETWORKS
2008
15 years 11 days 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
86
Voted
NETWORKS
2008
15 years 11 days ago
Decontamination of hypercubes by mobile agents
In this paper we consider the decontamination problem in a hypercube network of size n. The nodes of the network are assumed to be contaminated and they have to be decontaminated ...
Paola Flocchini, Miao Jun Huang, Flaminia L. Lucci...
121
Voted
NETWORKS
2008
15 years 11 days ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
93
Voted
NETWORKS
2008
15 years 11 days ago
A simple method for improving the primal simplex method for the multicommodity flow problem
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
Agustín Bompadre, James B. Orlin
NETWORKS
2008
15 years 11 days ago
On a graph coloring problem arising from discrete tomography
Cédric Bentz, Marie-Christine Costa, Domini...
NCA
2008
IEEE
15 years 11 days ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...