On the public citation graph

Solution methods and computational investigations for the Linear Bottleneck Assignment Problem

https://doi.org/10.1007/bf02684443
0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-51576-7openalex-snapshot
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
inferredcites →https://doi.org/10.1007/bf01919285openalex-snapshot
An in-core/out-of-core method for solving large scale assignment problems
inferredcites →https://doi.org/10.1007/bf02022037openalex-snapshot
The shortest augmenting path method for solving assignment problems — Motivation and computational experience
inferredcites →https://doi.org/10.1007/bf02240182openalex-snapshot
Alternate strategies for solving bottleneck assignment problems —analysis and computational results
inferredcites →https://doi.org/10.1007/bf02240205openalex-snapshot
An efficient labeling technique for solving sparse assignment problems
inferredcites →https://doi.org/10.1007/bf02243552openalex-snapshot
Algorithm for the solution of the Bottleneck Assignment Problem
inferredcites →https://doi.org/10.1007/bf02247938openalex-snapshot
Algorithm for the solution of the assignment problem for sparse matrices
inferredcites →https://doi.org/10.1007/bf02252026openalex-snapshot
An augmenting path method for solving Linear Bottleneck Assignment problems
inferredcites →https://doi.org/10.1016/0020-0190(91)90195-nopenalex-snapshot
Computing a maximum cardinality matching in a bipartite graph in time O(n1.5)
inferredcites →https://doi.org/10.1016/0166-218x(94)90039-6openalex-snapshot
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
inferredcites →https://doi.org/10.1016/0196-6774(88)90031-4openalex-snapshot
Algorithms for two bottleneck optimization problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)73612-0openalex-snapshot
Random Graphs of Small Order
inferredcites →https://doi.org/10.1051/ro/1996300201271openalex-snapshot
The random linear bottleneck assignment problem
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nav.20446openalex-snapshot
Quadratic bottleneck problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_2openalex-snapshot
Linear Assignment Problems and Extensions
inferred← citeshttps://doi.org/10.1007/s10589-021-00340-0openalex-snapshot
An alternate approach to solve two-level priority based assignment problem
inferred← citeshttps://doi.org/10.1007/s10878-018-0318-2openalex-snapshot
An improved algorithm for two stage time minimization assignment problem
inferred← citeshttps://doi.org/10.1007/s11370-009-0050-yopenalex-snapshot
Scalable and practical pursuit-evasion with networked robots
inferred← citeshttps://doi.org/10.1007/s12597-019-00399-8openalex-snapshot
A priority based unbalanced time minimization assignment problem
inferred← citeshttps://doi.org/10.1007/s40314-022-01999-9openalex-snapshot
Task preference-based bottleneck assignment problem
inferred← citeshttps://doi.org/10.1016/j.apm.2016.03.038openalex-snapshot
A priority based assignment problem
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107632openalex-snapshot
A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization
inferred← citeshttps://doi.org/10.1016/j.dajour.2024.100401openalex-snapshot
A lexicographic approach for solving bi-criteria bottleneck assignment problems
inferred← citeshttps://doi.org/10.1016/j.dam.2023.02.010openalex-snapshot
Allocation of indivisible items with individual preference graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.037openalex-snapshot
Sensitivity analysis for bottleneck assignment problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.123405openalex-snapshot
An efficient solution approach to capacitated three-level hierarchical time minimization transportation problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.11.011openalex-snapshot
Bottleneck flows in unit capacity networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.03.003openalex-snapshot
GraphCS: Graph-based client selection for heterogeneity in federated learning
inferred← citeshttps://doi.org/10.1016/j.omega.2006.02.007openalex-snapshot
Two-stage time minimizing assignment problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00343-2openalex-snapshot
Selected topics on assignment problems
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00040-6openalex-snapshot
A new matrix bandwidth reduction algorithm
inferred← citeshttps://doi.org/10.1109/ccsb63463.2024.10735683openalex-snapshot
Deep Learning for Tomato Leaf Disease Recognition in Balanced Data Environment
inferred← citeshttps://doi.org/10.1109/cdc.2003.1272701openalex-snapshot
Modelling and computation of optimal task assignment for cooperative control
inferred← citeshttps://doi.org/10.4108/icst.robocomm2009.5838openalex-snapshot
Scalable and Practical Pursuit-Evasion
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3858openalex-snapshot
Bottleneck flows in networks
inferred← citeshttps://doi.org/10.52783/jes.1233openalex-snapshot
A Feasible Flow-based Algorithm for Solving Classic Assignment Problem with Bottleneck
inferred← citeshttps://doi.org/10.5753/sbrlars_estendido.2024.244560openalex-snapshot
Parallel Multi-speed Pursuit-Evasion Game Algorithms
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.