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

From MaRDI portal

(Redirected from Publication:496669)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_branch-and-cut_algorithm_for_the_latent-class_logit_assortment_problem&oldid=62280582"