Upper bound for the capacitated competitive facility location problem

DOI10.1007/978-3-319-42902-1_12MaRDI QIDQ4596198zbMATH OpenOpenAlexFDO

Authors Andrey Melnikov, V. L. Beresnev

Publication date 1 December 2017

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-42902-1_12

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mixed integer programming (90C11)

Recommendations

• Exact method for the capacitated competitive facility location problem
• A capacitated competitive facility location problem
• Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
• Upper bounds for goal functions of discrete competitive facility location problems
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios

Cited in

(8)

• Exact method for the capacitated competitive facility location problem
• Weak flow cover inequalities for the capacitated facility location problem
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
• Upper Bound for the Competitive Facility Location Problem with Quantile Criterion
• The Capacitated p-facility Location Problem on the Real Line
• scientific article; zbMATH DE number 1189254 (Why is no real title available?)
• Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios

This page was built for publication: Upper bound for the capacitated competitive facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596198)