On the public citation graph
Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front
0 signed · 74 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(198704)34:2<229::aid-nav3220340207>3.0.co;2-1openalex-snapshot
On the rectangularp-center problem
inferredcites →https://doi.org/10.1007/0-306-48107-3_8openalex-snapshot
Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
inferredcites →https://doi.org/10.1007/3-540-44985-x_22openalex-snapshot
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
inferredcites →https://doi.org/10.1007/978-3-030-21803-4_79openalex-snapshot
K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front
inferredcites →https://doi.org/10.1007/978-3-030-41913-4_15openalex-snapshot
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time
inferredcites →https://doi.org/10.1007/978-3-319-49103-5_3openalex-snapshot
MBSE, PLM, MIP and Robust Optimization for System of Systems Management, Application to SCCOA French Air Defense Program
inferredcites →https://doi.org/10.1007/978-3-540-24854-5_20openalex-snapshot
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
inferredcites →https://doi.org/10.1007/978-3-540-69903-3_26openalex-snapshot
On Metric Clustering to Minimize the Sum of Radii
inferredcites →https://doi.org/10.1007/b101915openalex-snapshot
Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys
inferredcites →https://doi.org/10.1007/bf01185335openalex-snapshot
The slab dividing approach to solve the EuclideanP-Center problem
inferredcites →https://doi.org/10.1007/bf01874389openalex-snapshot
When are NP-hard location problems easy?
inferredcites →https://doi.org/10.1007/bf02614317openalex-snapshot
Cluster analysis and mathematical programming
inferredcites →https://doi.org/10.1007/bfb0028271openalex-snapshot
Parametric search and locating supply centers in trees
inferredcites →https://doi.org/10.1007/pl00009311openalex-snapshot
A Near-Linear Algorithm for the Planar 2-Center Problem
inferredcites →https://doi.org/10.1007/s00453-001-0110-yopenalex-snapshot
Exact and Approximation Algorithms for Clustering
inferredcites →https://doi.org/10.1007/s00453-009-9282-7openalex-snapshot
On Metric Clustering to Minimize the Sum of Radii
inferredcites →https://doi.org/10.1007/s00453-014-9907-3openalex-snapshot
On Minimum Sum of Radii and Diameters Clustering
inferredcites →https://doi.org/10.1007/s101070050011openalex-snapshot
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
inferredcites →https://doi.org/10.1007/s10732-018-9383-zopenalex-snapshot
Archivers for the representation of the set of approximate solutions for MOPs
inferredcites →https://doi.org/10.1007/s10732-018-9403-zopenalex-snapshot
Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem
inferredcites →https://doi.org/10.1007/s10732-020-09450-0openalex-snapshot
Matheuristics to optimize refueling and maintenance planning of nuclear power plants
inferredcites →https://doi.org/10.1007/s10878-012-9452-4openalex-snapshot
Some variations on constrained minimum enclosing circle problem
inferredcites →https://doi.org/10.1007/s10898-019-00841-7openalex-snapshot
On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
inferredcites →https://doi.org/10.1007/s10898-023-01280-1openalex-snapshot
Faster distance-based representative skyline and k-center along pareto front in the plane
inferredcites →https://doi.org/10.1016/0020-0190(88)90174-3openalex-snapshot
A study on two geometric location problems
inferredcites →https://doi.org/10.1016/0020-0190(96)00116-0openalex-snapshot
Output-sensitive peeling of convex and maximal layers
inferredcites →https://doi.org/10.1016/0166-218x(79)90044-1openalex-snapshot
Easy and hard bottleneck location problems
inferredcites →https://doi.org/10.1016/0304-3975(85)90224-5openalex-snapshot
Clustering to minimize the maximum intercluster distance
inferredcites →https://doi.org/10.1016/0377-2217(90)90297-oopenalex-snapshot
The discrete p-dispersion problem
inferredcites →https://doi.org/10.1016/j.cor.2013.07.011openalex-snapshot
Double bound method for solving the p-center location problem
inferredcites →https://doi.org/10.1016/j.ejor.2010.10.021openalex-snapshot
A clustering procedure for reducing the number of representative solutions in the Pareto Front of multiobjective optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2016.08.038openalex-snapshot
Speeding up the optimal method of Drezner for the p -centre problem in the plane
inferredcites →https://doi.org/10.1016/j.jcss.2003.07.014openalex-snapshot
Clustering to minimize the sum of cluster diameters
inferredcites →https://doi.org/10.1016/j.swevo.2020.100720openalex-snapshot
A comparative study of high-productivity high-performance programming languages for parallel metaheuristics
inferredcites →https://doi.org/10.1016/j.tcs.2010.05.034openalex-snapshot
The planar k -means problem is NP-hard
inferredcites →https://doi.org/10.1016/j.tcs.2015.05.028openalex-snapshot
Efficient algorithms for the one-dimensional k-center problem
inferredcites →https://doi.org/10.1016/s0925-7721(99)00052-8openalex-snapshot
Discrete rectilinear 2-center problems
inferredcites →https://doi.org/10.1057/jors.1984.150openalex-snapshot
The p-Centre Problem—Heuristic and Optimal Algorithms
inferredcites →https://doi.org/10.1109/icde.2009.84openalex-snapshot
Distance-Based Representative Skyline
inferredcites →https://doi.org/10.1111/gean.1999.31.1.217openalex-snapshot
Two New Location Covering Problems: The Partial P‐Center Problem and the Partial Set Covering Problem
inferredcites →https://doi.org/10.1137/0212051openalex-snapshot
New Results on the Complexity of p -Centre Problems
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213014openalex-snapshot
On the Complexity of Some Common Geometric Location Problems
inferredcites →https://doi.org/10.1137/19m1290607openalex-snapshot
Generalized K-Core Percolation in Networks with Community Structure
inferredcites →https://doi.org/10.1145/1569901.1569980openalex-snapshot
Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences
inferredcites →https://doi.org/10.1145/2576768.2598276openalex-snapshot
Two-dimensional subset selection for hypervolume and epsilon-indicator
inferredcites →https://doi.org/10.1162/evco_a_00157openalex-snapshot
Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms
inferredcites →https://doi.org/10.1287/ijoc.1030.0028openalex-snapshot
A New Formulation and Resolution Method for the p-Center Problem
inferredcites →https://doi.org/10.1287/mnsc.27.7.848openalex-snapshot
Note—On a Modified One-Center Model
inferredcites →https://doi.org/10.1287/moor.10.2.180openalex-snapshot
A Best Possible Heuristic for the k-Center Problem
inferredcites →https://doi.org/10.1287/opre.42.2.299openalex-snapshot
Heuristic and Special Case Algorithms for Dispersion Problems
inferredcites →https://doi.org/10.2307/2581980openalex-snapshot
The p-Centre Problem-Heuristic and Optimal Algorithms
inferredcites →https://doi.org/10.2307/3010074openalex-snapshot
Network and Discrete Location: Models, Algorithms and Applications.
inferredcites →https://doi.org/10.32614/rj-2011-015openalex-snapshot
Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming
inferredcites →https://doi.org/10.4230/lipics.socg.2017.22openalex-snapshot
Maximum Volume Subset Selection for Anchored Boxes
inferredcites →https://doi.org/10.48550/arxiv.0902.3282openalex-snapshot
Computing k-Centers On a Line
inferredcites →https://doi.org/10.48550/arxiv.1806.02098openalex-snapshot
k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front
inferredcites →https://doi.org/10.5555/314161.314198openalex-snapshot
Faster construction of planar two-centers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-85672-4_2openalex-snapshot
Comparing Local Search Initialization for K-Means and K-Medoids Clustering in a Planar Pareto Front, a Computational Study
inferred← citeshttps://doi.org/10.1007/978-3-031-34020-8_22openalex-snapshot
Partial K-Means with M Outliers: Mathematical Programs and Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_18openalex-snapshot
Efficient k-Center Algorithms for Planar Points in Convex Position
inferred← citeshttps://doi.org/10.1007/s10898-023-01280-1openalex-snapshot
Faster distance-based representative skyline and k-center along pareto front in the plane
inferred← citeshttps://doi.org/10.1051/ro/2023034openalex-snapshot
Polynomial algorithms for p-dispersion problems in a planar Pareto Front
inferred← citeshttps://doi.org/10.1134/s0040601523080086openalex-snapshot
Multi-objective Optimization of Shell-and-Tube Heat Exchangers According to Different Expressions of the Second Law of Thermodynamics
inferred← citeshttps://doi.org/10.3390/math10111825openalex-snapshot
An Equity-Based Optimization Model to Solve the Location Problem for Healthcare Centers Applied to Hospital Beds and COVID-19 Vaccination
inferred← citeshttps://doi.org/10.3390/math11112418openalex-snapshot
Kit of Uniformly Deployed Sets for p-Location Problems
inferred← citeshttps://doi.org/10.3390/math12040606openalex-snapshot
Allocation of Starting Points in Global Optimization Problems
inferred← citeshttps://doi.org/10.3390/math9212762openalex-snapshot
Special Issue “Mathematical Methods for Operations Research Problems”
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.