On the planar piecewise quadratic 1-center problem
DOI10.1007/S00453-008-9210-2zbMATH Open1191.68768OpenAlexW1972548393WikidataQ58217213 ScholiaQ58217213MaRDI QIDQ2379920FDOQ2379920
Authors: Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir 
Publication date: 23 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9210-2
Recommendations
Quadratic programming (90C20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Convex Analysis
- Title not available (Why is that?)
- Efficient algorithms for the smallest enclosing ball problem
- One-way and round-trip center location problems
- One-facility location with rectilinear tour distances
- Linear Programming in Linear Time When the Dimension Is Fixed
- Las Vegas algorithms for linear and integer programming when the dimension is small
- The collection depots location problem on networks
- On the collection depots location problem
- Helly-type theorems and generalized linear programming
- A subexponential bound for linear programming
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- The Minimum Covering Sphere Problem
- Slowing down sorting networks to obtain faster sorting algorithms
- A geometrical solution for quadratic bicriteria location models
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Parallel Merge Sort
- Robustness in the Pareto-solutions for the multi-criteria minisum location problem
- An Approach to Location Models Involving Sets as Existing Facilities
- On the combinatorial and algebraic complexity of quantifier elimination
- On the ball spanned by balls
- Minimizing the sum of the \(k\) largest functions in linear time.
- Locating facilities by minimax relative to closest points of demand areas
- Geometric complexity of some location problems
- Center location problems on tree graphs with subtree-shaped customers
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- A 1-center problem on the plane with uniformly distributed demand points
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
- General models in min-max continuous location: Theory and solution techniques
- General models in min-max planar location: Checking optimality conditions
- Maximizing non-linear concave functions in fixed dimension
Cited In (5)
- Title not available (Why is that?)
- The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
- A geometric characterisation of the quadratic min-power centre
- Periodic solutions of the planar \(N\)-center problem with topological constraints
- On the planar two-center problem and circular hulls
This page was built for publication: On the planar piecewise quadratic 1-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379920)
