Location, pricing and the problem of Apollonius
From MaRDI portal
Publication:1686568
Recommendations
Cites work
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Automata, Languages and Programming
- Fast approximation algorithms for a nonconvex covering problem
- Improved results on geometric hitting set problems
- Location, pricing and the problem of Apollonius
- On profit-maximizing envy-free pricing
- On the Complexity of Nonconvex Covering
Cited in
(5)- 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
- Facility location and pricing problem: discretized mill price and exact algorithms
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
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)