Search Results

There are 6358 results for: content related to: Acceleration of cutting-plane and column generation algorithms: Applications to network design

  1. Pure Cutting-Plane Algorithms and their Convergence

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Dinakar Gade and Simge Küçükyavuz

    Published Online : 15 OCT 2013, DOI: 10.1002/9780470400531.eorms1084

  2. The Privatisation of GIO Australia: Success or Failure?

    Australian Journal of Public Administration

    Volume 55, Issue 3, September 1996, Pages: 18–25, Anthony Casey and Brian Dollery

    Article first published online : 28 JUN 2008, DOI: 10.1111/j.1467-8500.1996.tb01219.x

  3. Minimum-weight subgraphs with unicyclic components and a lower-bounded girth

    Networks

    Volume 61, Issue 4, July 2013, Pages: 335–355, Walid Ben-Ameur, Makhlouf Hadji and Adam Ouorou

    Article first published online : 9 NOV 2012, DOI: 10.1002/net.21487

  4. Branch and Cut

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    John E. Mitchell

    Published Online : 14 JAN 2011, DOI: 10.1002/9780470400531.eorms0117

  5. An improved branch-and-cut algorithm for mixed-integer nonlinear systems optimization problem

    AIChE Journal

    Volume 54, Issue 12, December 2008, Pages: 3239–3247, Yushan Zhu, Yijiong Hu, Hao Wu and Masaru Nakaiwa

    Article first published online : 3 NOV 2008, DOI: 10.1002/aic.11616

  6. On the hierarchy of γ-valid cuts in global optimization

    Naval Research Logistics (NRL)

    Volume 55, Issue 1, February 2008, Pages: 1–15, Marcus Porembski

    Article first published online : 18 OCT 2007, DOI: 10.1002/nav.20257

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

  8. A three-stage procurement optimization problem under uncertainty

    Naval Research Logistics (NRL)

    Volume 60, Issue 5, August 2013, Pages: 395–412, Mike Prince, J. Cole Smith and Joseph Geunes

    Article first published online : 3 JUL 2013, DOI: 10.1002/nav.21541

  9. Route optimization for multiple searchers

    Naval Research Logistics (NRL)

    Volume 57, Issue 8, December 2010, Pages: 701–717, Johannes O. Royset and Hiroyuki Sato

    Article first published online : 28 OCT 2010, DOI: 10.1002/nav.20432

  10. The clique partitioning problem: Facets and patching facets

    Networks

    Volume 38, Issue 4, December 2001, Pages: 209–226, Maarten Oosten, Jeroen H. G. C. Rutten and Frits C. R. Spieksma

    Article first published online : 15 NOV 2001, DOI: 10.1002/net.10004

  11. Spherical cuts for integer programming problems

    International Transactions in Operational Research

    Volume 15, Issue 3, May 2008, Pages: 283–294, Leo Liberti

    Article first published online : 9 APR 2008, DOI: 10.1111/j.1475-3995.2008.00604.x

  12. Recent results on Arc Routing Problems: An annotated bibliography

    Networks

    Volume 56, Issue 1, August 2010, Pages: 50–69, Angel Corberán and Christian Prins

    Article first published online : 16 OCT 2009, DOI: 10.1002/net.20347

  13. The Rural Postman Problem with time windows

    Networks

    Volume 64, Issue 3, October 2014, Pages: 169–180, Marcela Monroy-Licht, Ciro Alberto Amaya and André Langevin

    Article first published online : 7 OCT 2014, DOI: 10.1002/net.21569

  14. An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs

    Naval Research Logistics (NRL)

    Volume 57, Issue 5, August 2010, Pages: 391–402, John Penuel, J. Cole Smith and Yang Yuan

    Article first published online : 9 APR 2010, DOI: 10.1002/nav.20401

  15. Numerical implementation of a shape memory alloy thermomechanical constitutive model using return mapping algorithms

    International Journal for Numerical Methods in Engineering

    Volume 47, Issue 6, 28 February 2000, Pages: 1123–1168, M. A. Qidwai and D. C. Lagoudas

    Article first published online : 11 JAN 2000, DOI: 10.1002/(SICI)1097-0207(20000228)47:6<1123::AID-NME817>3.0.CO;2-N

  16. Lower and upper bounds for the degree-constrained minimum spanning tree problem

    Networks

    Volume 50, Issue 1, August 2007, Pages: 55–66, Alexandre Salles da Cunha and Abilio Lucena

    Article first published online : 30 APR 2007, DOI: 10.1002/net.20166

  17. DTI in Context: Illustrating Brain Fiber Tracts In Situ

    Computer Graphics Forum

    Volume 29, Issue 3, June 2010, Pages: 1023–1032, Pjotr Svetachov, Maarten H. Everts and Tobias Isenberg

    Article first published online : 12 AUG 2010, DOI: 10.1111/j.1467-8659.2009.01692.x

  18. Introduction to Large-Scale Linear Programming and Applications

    Standard Article

    Wiley Encyclopedia of Operations Research and Management Science

    Stephen J. Stoyan, Maged M. Dessouky and Xiaoqing Wang

    Published Online : 15 FEB 2011, DOI: 10.1002/9780470400531.eorms0451

  19. The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

    Software: Practice and Experience

    Volume 30, Issue 11, September 2000, Pages: 1325–1352, Michael Jünger and Stefan Thienel

    Article first published online : 24 AUG 2000, DOI: 10.1002/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T

  20. Polyhedral techniques in combinatorial optimization I: Theory

    Statistica Neerlandica

    Volume 50, Issue 1, March 1996, Pages: 3–26, K. Aardal and C. P. M. van Hoesel

    Article first published online : 29 APR 2008, DOI: 10.1111/j.1467-9574.1996.tb01478.x