Works matching IS 00283045 AND DT 2008 AND VI 51 AND IP 1

Results: 7

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.

Published in:

Networks, 2008, v. 51, n. 1, p. 4, doi. 10.1002/net.20192

By:

Gendreau, Michel;
Iori, Manuel;
Laporte, Gilbert;
Martello, Silvaro

Publication type:

Article

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

Published in:

Networks, 2008, v. 51, n. 1, p. 63, doi. 10.1002/net.20196

By:

Bompadre, Agustín;
Orlin, James B.

Publication type:

Article

Foreword.

Published in:

Networks, 2008, v. 51, n. 1, p. 1, doi. 10.1002/net.20191

By:

Gallo, Giorgio;
Scutellà, Maria Grazia

Publication type:

Article

New approaches for solving the block-to-train assignment problem.

Published in:

Networks, 2008, v. 51, n. 1, p. 48, doi. 10.1002/net.20195

By:

Jha, Krishna C.;
Ahuja, Ravindra K.;
Şahin, Güvenç

Publication type:

Article

Models and heuristics for a minimum arborescence problem.

Published in:

Networks, 2008, v. 51, n. 1, p. 34, doi. 10.1002/net.20194

By:

Duhamel, Christophe;
Gouveia, Luis;
Moura, Pedro;
Souza, Mauricio

Publication type:

Article

Solving the hub location problem in a star-star network.

Published in:

Networks, 2008, v. 51, n. 1, p. 19, doi. 10.1002/net.20193

By:

Labbé, Martine;
Yaman, Hande

Publication type:

Article

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.

Published in:

Networks, 2008, v. 51, n. 1, p. 78, doi. 10.1002/net.20197

By:

Apollonio, N.;
Lari, I.;
Ricca, F.;
Simeone, B.;
Puerto, J.

Publication type:

Article