@article{Gendreau-Iori-Laporte-Martello/08,
AUTHOR = {Gendreau, Michel and Iori, Manuel and Laporte, Gilbert and Martello, Silvaro},
TITLE = {A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {4-18},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20192},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {see Erratum in Networks, Vol. 51, 2008, No. 2, 153-153},
}
@article{Labbe-Yaman/08,
AUTHOR = {Labb{\'{e}}, Martine and Yaman, Hande},
TITLE = {Solving the hub location problem in a star-star network},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {19-33},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20193},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Duhamel-Gouveia-Moura-Souza/08,
AUTHOR = {Duhamel, Christophe and Gouveia, Luis and Moura, Pedro and Souza, Mauricio},
TITLE = {Models and heuristics for a minimum arborescence problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {34-47},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20194},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jha-Ahuja-Sahin/08,
AUTHOR = {Jha, Krishna C. and Ahuja, Ravindra K. and {\c{S}}ahin, G{\"{u}}ven{\c{c}}},
TITLE = {New approaches for solving the block-to-train assignment problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {48-62},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20195},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bompadre-Orlin/08,
AUTHOR = {Bompadre, Agust{\'{i}}n and Orlin, James B.},
TITLE = {A simple method for improving the primal simplex method for the multicommodity flow problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {63-77},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20196},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Apollonio-Lari-Ricca-Simeone-Puerto/08,
AUTHOR = {Apollonio, N. and Lari, I. and Ricca, F. and Simeone, B. and Puerto, J.},
TITLE = {Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {1},
PAGES = {78-89},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20197},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hsieh/08a,
AUTHOR = {Hsieh, Sun-Yuan},
TITLE = {Some edge-fault-tolerant properties of the folded hypercube},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {92-101},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20204},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Scutella/08,
AUTHOR = {Scutell{\`{a}}, Maria G.},
TITLE = {The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {102-112},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20205},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{van_den_Heuvel-Johnson/08,
AUTHOR = {van den Heuvel, Jan and Johnson, Matthew},
TITLE = {Transversals of subtree hypergraphs and the source location problem in digraphs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {113-119},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20206},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hicks/08,
AUTHOR = {Hicks, Illya V.},
TITLE = {New facets for the planar subgraph polytope},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {120-132},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20207},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{de_Souza-Mahey-Gendron/08,
AUTHOR = {de Souza, Mauricio C. and Mahey, Philippe and Gendron, Bernard},
TITLE = {Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {133-141},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20208},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Onal-Wang/08,
AUTHOR = {{\"{O}}nal, Hayri and Wang, Yicheng},
TITLE = {A graph theory approach for designing conservation reserve networks with minimal fragmentation},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {142-152},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20211},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gendreau-Iori-Laporte-Martello/08a,
AUTHOR = {Gendreau, Michel and Iori, Manuel and Laporte, Gilbert and Martello, Silvano},
TITLE = {Erratum to ``A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints''},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {2},
PAGES = {153-153},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20245},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {Originally in Networks, Vol. 51, 2008, No. 1, 4-18},
}
@article{Righini-Salani/08,
AUTHOR = {Righini, Giovanni and Salani, Matteo},
TITLE = {New dynamic programming algorithms for the resource constrained elementary shortest path problem},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {155-170},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20212},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lai-Chen/08,
AUTHOR = {Lai, Cheng-Nan and Chen, Gen-Huey},
TITLE = {$w$-Rabin numbers and strong $w$-Rabin numbers of folded hypercubes},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {171-177},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20213},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Levin-Paulusma-Woeginger/08,
AUTHOR = {Levin, Asaf and Paulusma, Daniel and Woeginger, Gerhard J.},
TITLE = {The computational complexity of graph contractions I: Polynomially solvable and $NP$-complete cases},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {178-189},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20214},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Baveja/08,
AUTHOR = {Baveja, Alok},
TITLE = {The fractional congestion bound for efficient edge disjoint routing},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {190-199},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20216},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wang-Lin/08a,
AUTHOR = {Wang, Shiying and Lin, Shangwei},
TITLE = {Sufficient conditions for a graph to be super restricted edge-connected},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {3},
PAGES = {200-209},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20217},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cami-Deo/08,
AUTHOR = {Cami, Aurel and Deo, Narsingh},
TITLE = {Techniques for analyzing dynamic random graph models of web-like networks: An overview},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {4},
PAGES = {211-255},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20215},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bentz-Costa-de_Werra-Picouleau-Ries/08,
AUTHOR = {Bentz, C. and Costa, M.C. and de Werra, D. and Picouleau, C. and Ries, B.},
TITLE = {On a graph coloring problem arising from discrete tomography},
JOURNAL = {Networks},
VOLUME = {51},
NUMBER = {4},
PAGES = {256-267},
YEAR = {2008},
EDITOR = {Gallo, Giorgio and Scuttel{\`a}, Maria Grazia},
URL = {http://dx.doi.org/10.1002/net.20218},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}