Search Results

There are 48913 results for: content related to: Theoretical and computational advances for network diversion

  1. Bounds on the Dimensions of 2-Spontaneous Emission Error Designs

    Journal of Combinatorial Designs

    Volume 24, Issue 10, October 2016, Pages: 439–460, Junling Zhou and Yanxun Chang

    Version of Record online : 12 FEB 2016, DOI: 10.1002/jcd.21514

  2. Cheapest paths in dynamic networks

    Networks

    Volume 69, Issue 1, January 2017, Pages: 23–32, Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia and Andrea Pacifici

    Version of Record online : 26 OCT 2016, DOI: 10.1002/net.21714

  3. Online scheduling with multi-state machines

    Networks

    Dawsen Hwang and Patrick Jaillet

    Version of Record online : 20 DEC 2017, DOI: 10.1002/net.21799

  4. Nonoblivious 2-Opt heuristics for the traveling salesman problem

    Networks

    Volume 62, Issue 3, October 2013, Pages: 201–219, Asaf Levin and Uri Yovel

    Version of Record online : 6 JUN 2013, DOI: 10.1002/net.21512

  5. 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

  6. Centroidal bases in graphs

    Networks

    Volume 64, Issue 2, September 2014, Pages: 96–108, Florent Foucaud, Ralf Klasing and Peter J. Slater

    Version of Record online : 26 AUG 2014, DOI: 10.1002/net.21560

  7. Minimal disconnected cuts in planar graphs

    Networks

    Volume 68, Issue 4, December 2016, Pages: 250–259, Marcin Kamiński, Daniël Paulusma, Anthony Stewart and Dimitrios M. Thilikos

    Version of Record online : 8 AUG 2016, DOI: 10.1002/net.21696

  8. Solutions to conjectures on the (k,ℓ)-rainbow index of complete graphs

    Networks

    Volume 62, Issue 3, October 2013, Pages: 220–224, Qingqiong Cai, Xueliang Li and Jiangli Song

    Version of Record online : 28 MAY 2013, DOI: 10.1002/net.21513

  9. Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems

    Networks

    Volume 67, Issue 4, July 2016, Pages: 299–315, Alper Atamtürk, Andrés Gómez and Simge Küçükyavuz

    Version of Record online : 21 MAR 2016, DOI: 10.1002/net.21677

  10. Minimum vertex blocker clique problem

    Networks

    Volume 64, Issue 1, August 2014, Pages: 48–64, Foad Mahdavi Pajouh, Vladimir Boginski and Eduardo L. Pasiliao

    Version of Record online : 14 MAY 2014, DOI: 10.1002/net.21556

  11. Network spot-checking games: Theory and application to toll enforcing in transportation networks

    Networks

    Volume 65, Issue 4, July 2015, Pages: 312–328, Ralf Borndörfer , Julia Buwaya, Guillaume Sagnol and Elmar Swarat

    Version of Record online : 6 FEB 2015, DOI: 10.1002/net.21596

  12. Cooperative covering problems on networks

    Networks

    Volume 63, Issue 4, July 2014, Pages: 334–349, Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics and Stefan Nickel

    Version of Record online : 20 MAR 2014, DOI: 10.1002/net.21549

  13. The cut property under demand uncertainty

    Networks

    Volume 66, Issue 2, September 2015, Pages: 159–168, Sara Mattia

    Version of Record online : 14 JUL 2015, DOI: 10.1002/net.21621

  14. 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

  15. A simple and efficient strategy for solving very large-scale generalized cable-trench problems

    Networks

    Volume 67, Issue 3, May 2016, Pages: 199–208, Francis J. Vasko, Eric Landquist, Gregory Kresge, Adam Tal, Yifeng Jiang and Xenophon Papademetris

    Version of Record online : 19 MAY 2015, DOI: 10.1002/net.21614

  16. A survey of resource constrained shortest path problems: Exact solution approaches

    Networks

    Volume 62, Issue 3, October 2013, Pages: 183–200, Luigi Di Puglia Pugliese and Francesca Guerriero

    Version of Record online : 6 JUN 2013, DOI: 10.1002/net.21511

  17. Online traveling salesman problems with rejection options

    Networks

    Volume 64, Issue 2, September 2014, Pages: 84–95, Patrick Jaillet and Xin Lu

    Version of Record online : 11 AUG 2014, DOI: 10.1002/net.21559

  18. Domain clustering for inter-domain path computation speed-up

    Networks

    Lorenzo Maggi, Jérémie Leguay, Johanne Cohen and Paolo Medagliani

    Version of Record online : 6 DEC 2017, DOI: 10.1002/net.21800

  19. 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

  20. Reduced-size formulations for metric and cut polyhedra in sparse graphs

    Networks

    Volume 69, Issue 1, January 2017, Pages: 142–150, Viet Hung Nguyen, Michel Minoux and Dang Phuong Nguyen

    Version of Record online : 22 NOV 2016, DOI: 10.1002/net.21723