Search Results

There are 253035 results for: content related to: Special issue of Networks on optimization in scheduled transportation networks

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

    Networks

    Volume 51, Issue 1, January 2008, Pages: 48–62, Krishna C. Jha, Ravindra K. Ahuja and Güvenç Şahin

    Article first published online : 28 NOV 2007, DOI: 10.1002/net.20195

  2. Decomposition techniques for the minimum toll revenue problem

    Networks

    Volume 44, Issue 2, September 2004, Pages: 142–150, Lihui Bai, Donald W. Hearn and Siriphong Lawphongpanich

    Article first published online : 27 JUL 2004, DOI: 10.1002/net.20024

  3. Vertex domination-critical graphs

    Networks

    Volume 18, Issue 3, Autumn (Fall) 1988, Pages: 173–179, Robert C. Brigham, Phyllis Z. Chinn and Ronald D. Dutton

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230180304

  4. Promoting Physical Activity Among Youth Through Community-Based Prevention Marketing

    Journal of School Health

    Volume 80, Issue 5, May 2010, Pages: 214–224, Carol A. Bryant, Anita H. Courtney, Robert J. McDermott, Moya L. Alfonso, Julie A. Baldwin, Jen Nickelson, Kelli R. McCormack Brown, Rita D. DeBate, Leah M. Phillips, Zachary Thompson and Yiliang Zhu

    Article first published online : 19 APR 2010, DOI: 10.1111/j.1746-1561.2010.00493.x

  5. Network optimization in supply chain management and financial engineering: An annotated bibliography

    Networks

    Volume 42, Issue 2, September 2003, Pages: 66–84, Joseph Geunes and Panos M. Pardalos

    Article first published online : 22 JUL 2003, DOI: 10.1002/net.10082

  6. A neighborhood search algorithm for the combined through and fleet assignment model with time windows

    Networks

    Volume 44, Issue 2, September 2004, Pages: 160–171, Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein and Amit Mukherjee

    Article first published online : 27 JUL 2004, DOI: 10.1002/net.20026

  7. A compilation of relations between graph invariants—supplement I

    Networks

    Volume 21, Issue 4, July 1991, Pages: 421–455, Robert C. Brigham and Ronald D. Dutton

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230210405

  8. Integer programming models and algorithms for the graph decontamination problem with mobile agents

    Networks

    Volume 61, Issue 1, January 2013, Pages: 1–19, John Penuel, J. Cole Smith and Siqian Shen

    Article first published online : 1 MAR 2012, DOI: 10.1002/net.21460

  9. Network design for reverse and closed-loop supply chains: An annotated bibliography of models and solution approaches

    Networks

    Volume 53, Issue 3, May 2009, Pages: 231–248, E. Akçalı, S. Çetinkaya and H. Üster

    Article first published online : 10 OCT 2008, DOI: 10.1002/net.20267

  10. Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network

    Networks

    Volume 53, Issue 2, March 2009, Pages: 91–103, April K. Andreas and J. Cole Smith

    Article first published online : 10 OCT 2008, DOI: 10.1002/net.20278

  11. A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

    Networks

    Volume 45, Issue 1, January 2005, Pages: 36–41, Ravindra K. Ahuja and Horst W. Hamacher

    Article first published online : 29 NOV 2004, DOI: 10.1002/net.20047

  12. Block-vertex duality and the one-median problem

    Networks

    Volume 15, Issue 4, Winter 1985, Pages: 395–412, M.-L. Chen, R. L. Francis, J. F. Lawrence, T. J. Lowe and S. Tufekci

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230150402

  13. Combinatorial algorithms for inverse network flow problems

    Networks

    Volume 40, Issue 4, December 2002, Pages: 181–187, Ravindra K. Ahuja and James B. Orlin

    Article first published online : 17 SEP 2002, DOI: 10.1002/net.10048

  14. Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

    Networks

    Volume 60, Issue 2, September 2012, Pages: 103–119, Siqian Shen and J. Cole Smith

    Article first published online : 28 OCT 2011, DOI: 10.1002/net.20464

  15. You have free access to this content
    Techniques for analyzing dynamic random graph models of web-like networks: An overview

    Networks

    Volume 51, Issue 4, July 2008, Pages: 211–255, Aurel Cami and Narsingh Deo

    Article first published online : 14 DEC 2007, DOI: 10.1002/net.20215

  16. Extreme point characterizations for infinite network flow problems

    Networks

    Volume 48, Issue 4, December 2006, Pages: 209–222, H. Edwin Romeijn, Dushyant Sharma and Robert L. Smith

    Article first published online : 12 SEP 2006, DOI: 10.1002/net.20134

  17. Worst-case incremental analysis for a class of p-facility location problems

    Networks

    Volume 39, Issue 3, May 2002, Pages: 139–143, R. L. Francis, T. J. Lowe and A. Tamir

    Article first published online : 19 MAR 2002, DOI: 10.1002/net.10021

  18. Dynamic shortest paths minimizing travel times and costs

    Networks

    Volume 41, Issue 4, July 2003, Pages: 197–205, Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino and Maria G. Scutellà

    Article first published online : 7 MAY 2003, DOI: 10.1002/net.10072

  19. New polynomial-time cycle-canceling algorithms for minimum-cost flows

    Networks

    Volume 36, Issue 1, August 2000, Pages: 53–63, P. T. Sokkalingam, Ravindra K. Ahuja and James B. Orlin

    Article first published online : 30 JUN 2000, DOI: 10.1002/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y

  20. A simplex algorithm for minimum-cost network-flow problems in infinite networks

    Networks

    Volume 52, Issue 1, August 2008, Pages: 14–31, Thomas C. Sharkey and H.Edwin Romeijn

    Article first published online : 11 JAN 2008, DOI: 10.1002/net.20221