Works matching IS 00283045 AND DT 2008 AND VI 52 AND IP 3

Results: 8

Shortest path network interdiction with asymmetric information.

Published in:

Networks, 2008, v. 52, n. 3, p. 133, doi. 10.1002/net.20236

By:

Bayrak, Halil;
Bailey, Matthew D.

Publication type:

Article

Hide-and-seek games on a tree to which Eulerian networks are attached.

Published in:

Networks, 2008, v. 52, n. 3, p. 162, doi. 10.1002/net.20235

By:

Alpern, Steve

Publication type:

Article

Price competition with elastic traffic.

Published in:

Networks, 2008, v. 52, n. 3, p. 141, doi. 10.1002/net.20239

By:

Ozdaglar, Asuman

Publication type:

Article

Network search games, with arbitrary searcher starting point.

Published in:

Networks, 2008, v. 52, n. 3, p. 156, doi. 10.1002/net.20241

By:

Dagan, Arnon;
Gal, Shmuel

Publication type:

Article

Preface.

Published in:

Networks, 2008, v. 52, n. 3, p. 109, doi. 10.1002/net.20234

By:

Smith, J. Cole

Publication type:

Article

Minimizing a stochastic maximum-reliability path.

Published in:

Networks, 2008, v. 52, n. 3, p. 111, doi. 10.1002/net.20238

By:

Pan, Feng;
Morton, David P.

Publication type:

Article

Reformulation and sampling to solve a stochastic network interdiction problem.

Published in:

Networks, 2008, v. 52, n. 3, p. 120, doi. 10.1002/net.20237

By:

Janjarassuk, Udom;
Linderoth, Jeff

Publication type:

Article

Decontamination of hypercubes by mobile agents.

Published in:

Networks, 2008, v. 52, n. 3, p. 167, doi. 10.1002/net.20240

By:

Flocchini, Paola;
Huang, Miao Jun;
Luccio, Flaminia L.

Publication type:

Article