On the public citation graph
Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
0 signed · 18 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.1007/978-3-540-68279-0_9openalex-snapshot
Lagrangian Relaxation for Integer Programming
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bfb0120690openalex-snapshot
Lagrangean relaxation for integer programming
inferredcites →https://doi.org/10.1007/bfb0120697openalex-snapshot
On improving relaxation methods by modified gradient techniques
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/0165-4896(81)90041-xopenalex-snapshot
The median procedure in cluster analysis and social choice theory
inferredcites →https://doi.org/10.1016/0377-2217(81)90247-2openalex-snapshot
Remarks on the requirement matrix of school timetable problems
inferredcites →https://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01580870openalex-snapshot
Facets of the clique partitioning polytope
inferred← citeshttps://doi.org/10.1007/bf01589097openalex-snapshot
A cutting plane algorithm for a clustering problem
inferred← citeshttps://doi.org/10.1007/bf02618466openalex-snapshot
Clustering and clique partitioning: Simulated annealing and tabu search approaches
inferred← citeshttps://doi.org/10.1007/s11336-009-9126-zopenalex-snapshot
Clustering Qualitative Data Based on Binary Equivalence Relations: Neighborhood Search Heuristics for the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1007/s12532-023-00249-1openalex-snapshot
CP-Lib: Benchmark Instances of the Clique Partitioning Problem
inferred← citeshttps://doi.org/10.1109/tai.2003.1250220openalex-snapshot
Integrating microarray data by consensus clustering
inferred← citeshttps://doi.org/10.1142/s0218213004001867openalex-snapshot
INTEGRATING MICROARRAY DATA BY CONSENSUS CLUSTERING
inferred← citeshttps://doi.org/10.1287/ijoc.9.1.30openalex-snapshot
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
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.