Computer Networks | Sciweavers

58

NETWORKS
2008

126views Computer Networks» more NETWORKS 2008»

Reformulation and sampling to solve a stochastic network interdiction problem

14 years 6 months ago

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

claim paper

Read More »

53

click to vote

NETWORKS
2008

120views Computer Networks» more NETWORKS 2008»

Decontamination of hypercubes by mobile agents

14 years 6 months ago

Download www.site.uottawa.ca

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...

claim paper

Read More »

44

click to vote

NETWORKS
2008

88views Computer Networks» more NETWORKS 2008»

Transversals of subtree hypergraphs and the source location problem in digraphs

14 years 6 months ago

Download www.cdam.lse.ac.uk

Jan van den Heuvel, Matthew Johnson

claim paper

Read More »

47

click to vote

NETWORKS
2008

88views Computer Networks» more NETWORKS 2008»

New facets for the planar subgraph polytope

14 years 6 months ago

Download www.caam.rice.edu

Illya V. Hicks

claim paper

Read More »

80

click to vote

NETWORKS
2008

223views Computer Networks» more NETWORKS 2008»

New dynamic programming algorithms for the resource constrained elementary shortest path problem

14 years 6 months ago

Download www.crema.unimi.it

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

claim paper

Read More »

54

click to vote

NETWORKS
2008

115views Computer Networks» more NETWORKS 2008»

A simple method for improving the primal simplex method for the multicommodity flow problem

14 years 6 months ago

Download jorlin.scripts.mit.edu

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

claim paper

Read More »

126

click to vote

NETWORKS
2008

316views Computer Networks» more NETWORKS 2008»

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases

14 years 6 months ago

Download pluto.mscc.huji.ac.il

Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...

claim paper

Read More »

42

click to vote

NETWORKS
2008

118views Computer Networks» more NETWORKS 2008»

On a graph coloring problem arising from discrete tomography

14 years 6 months ago

Download www.lri.fr

Cédric Bentz, Marie-Christine Costa, Domini...

claim paper

Read More »

83

click to vote

NCA
2008
IEEE

165views Computer Networks» more NCA 2008»

Neurodynamic programming: a case study of the traveling salesman problem

14 years 6 months ago

Download www.ece.uic.edu

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 ...

claim paper

Read More »

47

click to vote

NCA
2008
IEEE

118views Computer Networks» more NCA 2008»

Studying possibility in a clustering algorithm for RBFNN design for function approximation

14 years 6 months ago