Search Results

There are 6464 results for: content related to: A branch-price-and-cut algorithm for the min-max k -vehicle windy rural postman problem

  1. You have free access to this content
    Critical nodes for distance-based connectivity and related problems in graphs

    Networks

    Volume 66, Issue 3, October 2015, Pages: 170–195, Alexander Veremyev, Oleg A. Prokopyev and Eduardo L. Pasiliao

    Version of Record online : 22 JUL 2015, DOI: 10.1002/net.21622

  2. Computing network tolls with support constraints

    Networks

    Volume 65, Issue 3, May 2015, Pages: 262–285, Tobias Harks, Ingo Kleinert, Max Klimm and Rolf H. Möhring

    Version of Record online : 20 MAR 2015, DOI: 10.1002/net.21604

  3. Reformulation and decomposition approaches for traffic routing in optical networks

    Networks

    Volume 67, Issue 4, July 2016, Pages: 277–298, Benoit Vignac, François Vanderbeck and Brigitte Jaumard

    Version of Record online : 4 APR 2016, DOI: 10.1002/net.21672

  4. Hardness and approximation for network flow interdiction

    Networks

    Volume 69, Issue 4, July 2017, Pages: 378–387, Stephen R. Chestnut and Rico Zenklusen

    Version of Record online : 13 MAR 2017, DOI: 10.1002/net.21739

  5. Dynamic shortest-path interdiction

    Networks

    Volume 68, Issue 4, December 2016, Pages: 315–330, Jorge A. Sefair and J. Cole Smith

    Version of Record online : 15 OCT 2016, DOI: 10.1002/net.21712

  6. Metric tree-like structures in real-world networks: an empirical study

    Networks

    Volume 67, Issue 1, January 2016, Pages: 49–68, Muad Abu-Ata and Feodor F. Dragan

    Version of Record online : 25 AUG 2015, DOI: 10.1002/net.21631

  7. You have free access to this content
    A node-based ILP formulation for the node-weighted dominating Steiner problem

    Networks

    Volume 69, Issue 1, January 2017, Pages: 33–51, Andreas Bley, Ivana Ljubić and Olaf Maurer

    Version of Record online : 25 NOV 2016, DOI: 10.1002/net.21722

  8. Bidirected minimum Manhattan network problem

    Networks

    Volume 69, Issue 2, March 2017, Pages: 167–178, Nicolas Catusse, Victor Chepoi, Karim Nouioua and Yann Vaxès

    Version of Record online : 21 NOV 2016, DOI: 10.1002/net.21719

  9. Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls

    Networks

    Volume 64, Issue 3, October 2014, Pages: 214–231, George Ninikas and Ioannis Minis

    Version of Record online : 7 OCT 2014, DOI: 10.1002/net.21567

  10. A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments

    Networks

    René van Bevern, Christian Komusiewicz and Manuel Sorge

    Version of Record online : 8 APR 2017, DOI: 10.1002/net.21742

  11. The bottleneck selected-internal and partial terminal Steiner tree problems

    Networks

    Volume 68, Issue 4, December 2016, Pages: 331–339, Yen Hung Chen

    Version of Record online : 19 OCT 2016, DOI: 10.1002/net.21713

  12. You have free access to this content
    The budgeted minimum cost flow problem with unit upgrading cost

    Networks

    Volume 69, Issue 1, January 2017, Pages: 67–82, Christina Büsing, Arie Koster, Sarah Kirchner and Annika Thome

    Version of Record online : 23 NOV 2016, DOI: 10.1002/net.21724

  13. Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria

    Networks

    Volume 67, Issue 1, January 2016, Pages: 69–81, Isabella Lari, Federica Ricca, Justo Puerto and Andrea Scozzari

    Version of Record online : 16 OCT 2015, DOI: 10.1002/net.21661

  14. Locating depots for capacitated vehicle routing

    Networks

    Volume 68, Issue 2, September 2016, Pages: 94–103, Inge Li Gørtz and Viswanath Nagarajan

    Version of Record online : 20 JUN 2016, DOI: 10.1002/net.21683

  15. Evangelism in social networks: Algorithms and complexity

    Networks

    Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno and Ugo Vaccaro

    Version of Record online : 17 JUL 2017, DOI: 10.1002/net.21756

  16. Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach

    Networks

    Volume 69, Issue 2, March 2017, Pages: 189–204, Maciej Rysz, Pavlo A. Krokhmal and Eduardo L. Pasiliao

    Version of Record online : 30 JAN 2017, DOI: 10.1002/net.21727

  17. The wireless network jamming problem subject to protocol interference

    Networks

    Volume 67, Issue 2, March 2016, Pages: 111–125, Hugh R. Medal

    Version of Record online : 27 NOV 2015, DOI: 10.1002/net.21664

  18. Exact algorithms for solving a Euclidean maximum flow network interdiction problem

    Networks

    Volume 64, Issue 2, September 2014, Pages: 109–124, Kelly M. Sullivan and J. Cole Smith

    Version of Record online : 25 AUG 2014, DOI: 10.1002/net.21561

  19. A characterization of irreducible infeasible subsystems in flow networks

    Networks

    Volume 68, Issue 2, September 2016, Pages: 121–129, Imke Joormann, James B. Orlin and Marc E. Pfetsch

    Version of Record online : 28 JUN 2016, DOI: 10.1002/net.21686

  20. A compact linear programming formulation of the maximum concurrent flow problem

    Networks

    Volume 65, Issue 1, January 2015, Pages: 68–87, Yuanyuan Dong, Eli V. Olinick, T. Jason Kratz and David W. Matula

    Version of Record online : 12 DEC 2014, DOI: 10.1002/net.21583