Location, pricing and the problem of Apollonius
From MaRDI portal
Publication:1686568
DOI10.1007/s11590-017-1159-0zbMath1383.90018OpenAlexW2626868260WikidataQ57338939 ScholiaQ57338939MaRDI QIDQ1686568
Andrej Winokurow, Alexander Grigoriev, André Berger, A. A. Panin
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1159-0
Related Items (4)
A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality ⋮ Facility location and pricing problem: discretized mill price and exact algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Improved results on geometric hitting set problems
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Location, Pricing and the Problem of Apollonius
- On the Complexity of Nonconvex Covering
- Fast approximation algorithms for a nonconvex covering problem
- Automata, Languages and Programming
This page was built for publication: Location, pricing and the problem of Apollonius
