Works matching IS 00283045 AND DT 2002 AND VI 39 AND IP 1

Results: 7

A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs.

Published in:

Networks, 2002, v. 39, n. 1, p. 53, doi. 10.1002/net.10010

By:

Williams, Justin C.

Publication type:

Article

On the geodetic number of a graph.

Published in:

Networks, 2002, v. 39, n. 1, p. 1, doi. 10.1002/net.10007

By:

Chartrand, Gary;
Harary, Frank;
Zhang, Ping

Publication type:

Article

A comparative analysis of several formulations for the generalized minimum spanning tree problem.

Published in:

Networks, 2002, v. 39, n. 1, p. 29, doi. 10.1002/net.10009

By:

Feremans, Corinne;
Labbé, Martine;
Laporte, Gilbert

Publication type:

Article

Minimax inverse problems of minimum cuts.

Published in:

Networks, 2002, v. 39, n. 1, p. 7, doi. 10.1002/net.10000

By:

Shigeno, Maiko

Publication type:

Article

On multiroute maximum flows in networks.

Published in:

Networks, 2002, v. 39, n. 1, p. 43, doi. 10.1002/net.10008

By:

Aggarwal, Charu C.;
Orlin, James B.

Publication type:

Article

Balanced network flows. VII. Primal-dual algorithms.

Published in:

Networks, 2002, v. 39, n. 1, p. 35, doi. 10.1002/net.10002

By:

Fremuth-Paeger, Christian;
Jungnickel, Dieter

Publication type:

Article

The simplex algorithm for multicommodity networks.

Published in:

Networks, 2002, v. 39, n. 1, p. 15, doi. 10.1002/net.10006

By:

Detlefsen, Nina K.;
Wallace, Stein W.

Publication type:

Article