A branch-and-bound algorithm for the maximum capture problem with random utilities

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A branch-and-bound algorithm for the maximum capture problem with random utilities
Authors
Keywords
Facility location, Branch and bound, Maximum capture, Random utility model
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 252, Issue 1, Pages 204-212
Publisher
Elsevier BV
Online
2015-12-23
DOI
10.1016/j.ejor.2015.12.026

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

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.