On the public citation graph
A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
0 signed · 35 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/bf01531073openalex-snapshot
The tabu search metaheuristic: How we used it
inferredcites →https://doi.org/10.1016/0196-6774(82)90011-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0969-6016(95)00029-7openalex-snapshot
Local Search Algorithms for the Maximal Planar Layout Problem
inferredcites →https://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferredcites →https://doi.org/10.1109/tsmc.1977.4309760openalex-snapshot
Crossing Theory and Hierarchy Mapping
inferredcites →https://doi.org/10.1109/tsmc.1980.4308390openalex-snapshot
Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1145/800146.804838openalex-snapshot
Automatic generation of logic diagrams
inferredcites →https://doi.org/10.1287/mnsc.20.5.783openalex-snapshot
A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_46openalex-snapshot
A polyhedral approach to the multi-layer crossing minimization problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_1openalex-snapshot
Meta-Heuristics: An Overview
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_24openalex-snapshot
Simple Tabu Thresholding and the Pallet Loading Problem.
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_7openalex-snapshot
An Aggressive Search Procedure for the Bipartite Drawing Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferred← citeshttps://doi.org/10.1007/s10878-010-9326-6openalex-snapshot
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00356-8openalex-snapshot
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2018.11.051openalex-snapshot
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
inferred← citeshttps://doi.org/10.1016/j.cor.2018.08.006openalex-snapshot
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.04.010openalex-snapshot
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00397-9openalex-snapshot
Heuristics and meta-heuristics for 2-layer straight line crossing minimization
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00083-4openalex-snapshot
Arc crossing minimization in hierarchical digraphs with tabu search
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00291-9openalex-snapshot
A tabu search algorithm for the bipartite drawing problem
inferred← citeshttps://doi.org/10.1023/a:1018958819459openalex-snapshot
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem
inferred← citeshttps://doi.org/10.1080/07408170108936883openalex-snapshot
Arc crossing minimization in graphs with GRASP
inferred← citeshttps://doi.org/10.1109/cec.2008.4631195openalex-snapshot
A hybrid simulated annealing algorithm for the Bipartite Crossing Number Minimization Problem
inferred← citeshttps://doi.org/10.1111/itor.13362openalex-snapshot
A multicommodity pickup and delivery problem with time windows and handling time in the omni‐channel last‐mile delivery
inferred← citeshttps://doi.org/10.1145/2133803.2212314openalex-snapshot
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization
inferred← citeshttps://doi.org/10.1287/ijoc.11.1.44openalex-snapshot
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
inferred← citeshttps://doi.org/10.6000/2371-1647.2015.01.02openalex-snapshot
A Unified Framework for Integer Programming Formulation of Graph Matching 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.