A branch-and-cut algorithm for the latent-class logit assortment problem

Published 2012 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A branch-and-cut algorithm for the latent-class logit assortment problem
Authors
Keywords
-
Journal
DISCRETE APPLIED MATHEMATICS
Volume 164, Issue -, Pages 246-263
Publisher
Elsevier BV
Online
2012-04-07
DOI
10.1016/j.dam.2012.03.003

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.