Zhejiang Agr & For University
Wiley Online Library
Wiley Online Library
Zhejiang Agr & For University
  • Advanced Search Citation Search
  • Advanced Search Citation Search
  • Individual login
  • Institutional login
  • REGISTER

Networks

Networks

Navigation Bar

Menu

Home
  • Home
  • About
    • Overview
    • Journal Metrics
    • Contact
    • Editorial Board
    • Become a Wiley Editor 
    • OA Advantages
    • Advertise
    • Permissions
  • Authors
    • Author Guidelines
    • Open Access
    • Submit a Manuscript
    • Calls for Papers
    • For Referees 
  • Browse
    • Accepted Articles
    • Early View
    • Current Issue
    • All Issues
    • Virtual Issues
    • Special Issues
  • Collections
    • Optimization 2023-Models and algorithms for network optimization problems
    • WARP2022-Arc Routing Problems and Other Related Topics
    • INOC2022 – New Trends in Network Optimization
    • EURO2022 – Emerging Topics in Network Optimization
    • VEROLOG 2022 – Networks on Advances in Vehicle Routing and Logistics Optimization

Follow journal

  • Alert
  • RSS Feeds
    • Most recent (RSS)
    • Most cited (RSS)

Journal list menu

  • Journal
  • Articles
  • Actions

    Tools

    Follow journal

  • Issue

    Networks: Volume 58, Issue 4

    Special Issue:Route 2009: 5th International Workshop on Vehicle Routing, June 21‐24; Skodsborg, Denmark
    239-322
    December 2011
Previous Issue|Next Issue
GO TO SECTION
    Export Citation(s)Download PDF(s)

    Export Citations

    Format
    Type of import
    Cancel
    < Go back
    Citation Help

    Download PDFs

    Cancel
    Item limit reached
    Download (.zip)
    no

    ROUTE 2009: Recent advances in vehicle routing optimization

    Oli B.G. Madsen,  Stefan Ropke, 
    • Pages: 239-240
    • First Published: 20 October 2011
    • Full text
    • PDF
    • Request permissions
    no

    A column generation approach for the split delivery vehicle routing problem

    C. Archetti,  N. Bianchessi,  M. G. Speranza, 
    • Pages: 241-254
    • First Published: 25 October 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions
    no

    New facets and an enhanced branch-and-cut for the min–max K-vehicles windy rural postman problem

    Enrique Benavent,  Angel Corberán,  Isaac Plana,  José M. Sanchis, 
    • Pages: 255-272
    • First Published: 30 September 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions
    no

    The vehicle routing problem with time windows and temporal dependencies

    Anders Dohn,  Matias Sevel Rasmussen,  Jesper Larsen, 
    • Pages: 273-289
    • First Published: 29 October 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions
    no

    Improved exact method for the double TSP with multiple stacks

    Richard M. Lusby,  Jesper Larsen, 
    • Pages: 290-300
    • First Published: 29 October 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions
    no

    Cutting planes for branch-and-price algorithms

    Guy Desaulniers,  Jacques Desrosiers,  Simon Spoorendonk, 
    • Pages: 301-310
    • First Published: 29 October 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions
    no

    A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    Min Wen,  Emil Krapper,  Jesper Larsen,  Thomas K. Stidsen, 
    • Pages: 311-322
    • First Published: 29 October 2011
    • Abstract
    • Full text
    • PDF
    • References
    • Request permissions

    Sign up for email alerts

    Enter your email to receive alerts when new articles and issues are published.

    Please select your location and accept the terms of use.

    Tools

    • Submit an article
    • Journal Metrics
    • Subscribe to this journal

    More from this journal

    • Calls for Papers
    • Special Issues
    • Mathematics Journals Free Sample Issues
    • Glover-Klingman Prize
    • Virtual Issue - Network Interdiction Applications and Extensions
    • Overleaf Submissions Template

    Related Titles

    • Naval Research Logistics (NRL)
      IssueVolume 72, Issue 5
      623-767
      August 2025
    • International Transactions in Operational Research
      IssueVolume 33, Issue 1
      1-714
      January 2026
    • International Journal of Communication Systems
      IssueVolume 38, Issue 13
      10 September 2025

    Stay Connected

    • Find us on X

    Additional links

    About Wiley Online Library

    • Privacy Policy
    • Terms of Use
    • About Cookies
    • Accessibility
    • Wiley Research DE&I Statement and Publishing Policies
    • Developing World Access

    Help & Support

    • Contact Us
    • Training and Support
    • DMCA & Reporting Piracy

    Opportunities

    • Subscription Agents
    • Advertisers & Corporate Partners

    Connect with Wiley

    • The Wiley Network
    • Wiley Press Room

    Copyright © 1999-2025 John Wiley & Sons, Inc or related companies. All rights reserved, including rights for text and data mining and training of artificial intelligence technologies or similar technologies.

    Wiley Home Page

    Log in to Wiley Online Library

    Forgot password?
    NEW USER > INSTITUTIONAL LOGIN >

    Change Password

    Too Short Weak Medium Strong Very Strong Too Long

    Your password must have 10 characters or more:

    • a lower case character, 
    • an upper case character, 
    • a special character 
    • or a digit
    Too Short

    Password Changed Successfully

    Your password has been changed

    Create a new account

    Returning user

    Forgot your password?

    Enter your email address below.

    Please check your email for instructions on resetting your password. If you do not receive an email within 10 minutes, your email address may not be registered, and you may need to create a new Wiley Online Library account.

    Request Username

    Can't sign in? Forgot your username?

    Enter your email address below and we will send you your username

    Close

    If the address matches an existing account you will receive an email with instructions to retrieve your username