Networks

Cover image for Networks

Special Issue: Networks Optimization Workshop, August 22–25, 2006

January 2010

Volume 55, Issue 1

Pages 1–59

Issue edited by: Dominique Feillet, Gilbert Laporte, Frédéric Semet

  1. Preface

    1. Top of page
    2. Preface
    1. Preface (page 1)

      Dominique Feillet, Gilbert Laporte and Frédéric Semet

      Version of Record online: 31 JUL 2009 | DOI: 10.1002/net.20308

    1. A branch-and-cut algorithm for the k-edge connected subgraph problem (pages 13–32)

      F. Bendali, I. Diarrassouba, A.R. Mahjoub, M. Didi Biha and J. Mailfert

      Version of Record online: 6 MAR 2009 | DOI: 10.1002/net.20310

    2. k-Splittable delay constrained routing problem: A branch-and-price approach (pages 33–45)

      Jérôme Truffot, Christophe Duhamel and Philippe Mahey

      Version of Record online: 6 MAY 2009 | DOI: 10.1002/net.20311

    3. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading (pages 46–59)

      Jean-François Cordeau, Manuel Iori, Gilbert Laporte and Juan José Salazar González

      Version of Record online: 6 MAY 2009 | DOI: 10.1002/net.20312

SEARCH

SEARCH BY CITATION