Crossmark

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

Crossref DOI link: https://doi.org/10.1016/j.ejor.2015.12.026

Published Print: 2016-07

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Freire, Alexandre S.

Moreno, Eduardo https://orcid.org/0000-0002-3404-8294
Yushimito, Wilfredo F. https://orcid.org/0000-0002-5528-2477
Funding

Funding for this research was provided by:

FAPESP (2012/17585-9)

FAPESP (2013/03447-6)
License Information

Text and Data Mining valid from 2016-07-01
More Information

This article is maintained by: Elsevier

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

Journal Title: European Journal of Operational Research

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.ejor.2015.12.026

Content Type: article

Copyright: Copyright © 2015 Elsevier B.V. All rights reserved.