Works matching IS 00283045 AND DT 2007 AND VI 49 AND IP 2

Results: 7

The stochastic time-cost tradeoff problem: A robust optimization approach.

Published in:

Networks, 2007, v. 49, n. 2, p. 175, doi. 10.1002/net.20153

By:

Cohen, Izack;
Golany, Boaz;
Shtub, Avraham

Publication type:

Article

On super edge-connectivity of Cartesian product graphs.

Published in:

Networks, 2007, v. 49, n. 2, p. 152, doi. 10.1002/net.20149

By:

Lü, Min;
Chen, Guo-Liang;
Xu, Jun-Ming

Publication type:

Article

Integer programming formulations for the two 4-hop-constrained paths problem.

Published in:

Networks, 2007, v. 49, n. 2, p. 135, doi. 10.1002/net.20147

By:

Huygens, David;
Ridha Mahjoub, A.

Publication type:

Article

Dilation-free graphs in the l.

Published in:

Networks, 2007, v. 49, n. 2, p. 168, doi. 10.1002/net.20152

By:

Cáceres, J.;
Grima, C.I.;
Márquez, A.;
Moreno-González, A.

Publication type:

Article

Approximation algorithm for the group Steiner network problem.

Published in:

Networks, 2007, v. 49, n. 2, p. 160, doi. 10.1002/net.20151

By:

Penn, Michal;
Rozenfeld, Stas

Publication type:

Article

Uniformly optimal digraphs for strongly connected reliability.

Published in:

Networks, 2007, v. 49, n. 2, p. 145, doi. 10.1002/net.20148

By:

Brown, J.I.;
Li, Xiaohu

Publication type:

Article

Maximum independent set for intervals by divide and conquer with pruning.

Published in:

Networks, 2007, v. 49, n. 2, p. 158, doi. 10.1002/net.20150

By:

Snoeyink, Jack

Publication type:

Article