Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements
Authors
Keywords
Hub location problem with service requirements, Robust optimization, Travel time uncertainty, Benders decomposition
Journal
EXPERT SYSTEMS WITH APPLICATIONS
Volume 93, Issue -, Pages 50-61
Publisher
Elsevier BV
Online
2017-10-12
DOI
10.1016/j.eswa.2017.10.005

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.