Tabu search for the discrete (r| p)-centroid problem

zbMATH Open1324.90131MaRDI QIDQ5263764FDOQ5263764

I. A. Davydov

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da680

Recommendations

• scientific article; zbMATH DE number 1253066
• scientific article; zbMATH DE number 1985661
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• An efficient tabu search procedure for the \(p\)-median problem
• scientific article; zbMATH DE number 1859297

zbMATH Keywords

bilevel programmingStackelberg gamescompetitive facility location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cooperative games (91A12)

Cited In (4)

• A bilevel planning model for public-private partnership
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• Comparison of models of planning public-private partnership

This page was built for publication: Tabu search for the discrete \((r| p)\)-centroid problem

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