Polyhedral Analysis for Concentrator Location Problems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Martine Labbé, Hande Yaman. Polyhedral Analysis for Concentrator Location Problems. Comp. Opt. and Appl., 34(3):377-407, 2006. [doi]

The following publications are possibly variants of this publication:

Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc CapacitiesHande Yaman. siamdm, 19(2):501-522, 2005. [doi]

The Ring Star Problem: Polyhedral analysis and exact algorithmMartine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González. networks, 43(3):177-189, 2004. [doi]

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithmCorinne Feremans, Martine Labbé, Gilbert Laporte. networks, 43(2):71-86, 2004. [doi]

Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitutionHande Yaman. DAM, 157(14):3133-3151, 2009. [doi]

The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and ComputationsAysegül Altin, Hande Yaman, Mustafa Ç. Pinar. informs, 23(1):75-89, 2011. [doi]

runs on WebDSL