Planar multi-facility location problems with polyhedral gauges
From MaRDI portal
Publication:4629348
zbMATH Open1409.90004MaRDI QIDQ4629348FDOQ4629348
Authors: Andrea Maier 
Publication date: 22 March 2019
Recommendations
- scientific article; zbMATH DE number 849181
- An interior point method for multi-facility location problems with regions forbidden for placement
- scientific article; zbMATH DE number 764411
- Combinatorial algorithms for some 1-facility median problems in the plane
- Complexity results on planar multifacility location problems with forbidden regions
Management decision making, including multiple objectives (90B50) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06)
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar multifacility location problems with tree structure and finite dominating sets
- An interior point method for multi-facility location problems with regions forbidden for placement
- Solving convex location problems with gauges in polynomial time
- Complexity results on planar multifacility location problems with forbidden regions
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
This page was built for publication: Planar multi-facility location problems with polyhedral gauges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629348)
