Location, pricing and the problem of Apollonius
From MaRDI portal
Publication:1686568
DOI10.1007/S11590-017-1159-0zbMATH Open1383.90018OpenAlexW2626868260WikidataQ57338939 ScholiaQ57338939MaRDI QIDQ1686568FDOQ1686568
Authors: André Berger, Alexander Grigoriev, Andrej Winokurow, 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
Recommendations
Cites Work
- On profit-maximizing envy-free pricing
- Fast approximation algorithms for a nonconvex covering problem
- Improved results on geometric hitting set problems
- Title not available (Why is that?)
- Automata, Languages and Programming
- Approximation schemes for NP-hard geometric optimization problems: a survey
- On the Complexity of Nonconvex Covering
- Location, pricing and the problem of Apollonius
Cited In (5)
- Facility location and pricing problem: discretized mill price and exact algorithms
- 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
- Location, pricing and the problem of Apollonius
- A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
This page was built for publication: Location, pricing and the problem of Apollonius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686568)