On the public citation graph
Tabu search for graph partitioning
0 signed · 88 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/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1002/net.3230200205openalex-snapshot
A class of bounded approximation algorithms for graph partitioning
inferredcites →https://doi.org/10.1007/bf01471219openalex-snapshot
Tabu search methods for a single machine scheduling problem
inferredcites →https://doi.org/10.1007/bf02022999openalex-snapshot
Massively parallel tabu search for the quadratic assignment problem
inferredcites →https://doi.org/10.1007/bf02023004openalex-snapshot
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
inferredcites →https://doi.org/10.1007/bf02023611openalex-snapshot
Interactive decision software and computer graphics for architectural and space planning
inferredcites →https://doi.org/10.1007/bf02060483openalex-snapshot
Avoiding local optima in thep-hub location problem using tabu search and GRASP
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
inferredcites →https://doi.org/10.1007/bf02243141openalex-snapshot
STABULUS: A technique for finding stable sets in large graphs with tabu search
inferredcites →https://doi.org/10.1007/bf02739239openalex-snapshot
Interactive decision software and computer graphics for architectural and space planning
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1016/0377-2217(94)90245-3openalex-snapshot
On tabu search for the location of interacting hub facilities
inferredcites →https://doi.org/10.1016/0957-4174(93)90056-copenalex-snapshot
Integrating target analysis and tabu search for improved scheduling systems
inferredcites →https://doi.org/10.1016/s0167-8191(05)80147-4openalex-snapshot
Robust taboo search for the quadratic assignment problem
inferredcites →https://doi.org/10.1080/07408179308964284openalex-snapshot
SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH
inferredcites →https://doi.org/10.1109/tcad.1987.1270326openalex-snapshot
Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1287/ijoc.2.1.33openalex-snapshot
Tabu Search Applied to the Quadratic Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.40.10.1276openalex-snapshot
A Tabu Search Heuristic for the Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.892266openalex-extracted
The Geography of Retail Inventory
inferred← citeshttps://doi.org/10.1002/9781118601181.ch6openalex-snapshot
Local Metaheuristics and Graph Partitioning
inferred← citeshttps://doi.org/10.1002/ett.4460120607openalex-snapshot
A large hierarchical network star—star topology design algorithm
inferred← citeshttps://doi.org/10.1002/nme.5003openalex-snapshot
A multilevel tabu search algorithm for balanced partitioning of unstructured grids
inferred← citeshttps://doi.org/10.1007/3-540-48432-9_16openalex-snapshot
Convergence of a Hill Climbing Genetic Algorithm for Graph Matching
inferred← citeshttps://doi.org/10.1007/3-540-62909-2_85openalex-snapshot
Deterministic search strategies for relational graph matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_23openalex-snapshot
A New Tabu Search Approach to the 0–1 Equicut 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/978-3-319-49487-6_4openalex-snapshot
Recent Advances in Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_116openalex-snapshot
A Hybrid Genetic Approach for Circuit Bipartitioning
inferred← citeshttps://doi.org/10.1007/s10479-017-2680-3openalex-snapshot
Dynamic temporary blood facility location-allocation during and post-disaster periods
inferred← citeshttps://doi.org/10.1007/s10619-019-07276-9openalex-snapshot
A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems
inferred← citeshttps://doi.org/10.1007/s10732-010-9148-9openalex-snapshot
An adaptive multi-start graph partitioning algorithm for structuring cellular networks
inferred← citeshttps://doi.org/10.1016/j.cor.2010.10.007openalex-snapshot
An effective multilevel tabu search approach for balanced graph partitioning
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105299openalex-snapshot
Local search for constrained graph clustering in biological networks
inferred← citeshttps://doi.org/10.1016/j.datak.2011.11.004openalex-snapshot
SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
inferred← citeshttps://doi.org/10.1016/j.dss.2003.12.006openalex-snapshot
Decision Support System induced guidance for model formulation and solution
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/j.endm.2004.06.024openalex-snapshot
Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs
inferred← citeshttps://doi.org/10.1016/s0031-3203(98)00152-6openalex-snapshot
Deterministic search for relational graph matching
inferred← citeshttps://doi.org/10.1016/s0031-3203(99)00171-5openalex-snapshot
Convergence of a hill-climbing genetic algorithm for graph matching
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00141-5openalex-snapshot
An efficient tabu search procedure for the p-Median Problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00287-7openalex-snapshot
Solution of large weighted equicut problems
inferred← citeshttps://doi.org/10.1023/a:1021950608048openalex-snapshot
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem
inferred← citeshttps://doi.org/10.1023/b:heur.0000019985.94952.ebopenalex-snapshot
Lock-Gain Based Graph Partitioning
inferred← citeshttps://doi.org/10.1057/jos.2015.12openalex-snapshot
LBMIC: communication-aware load balancing in distributed ASMs with evolving social networks
inferred← citeshttps://doi.org/10.1061/41036(342)37openalex-snapshot
Industrial Distribution System Simulation for Optimal Water Resource Assignment Using Probabilistic Tabu Search
inferred← citeshttps://doi.org/10.1109/12.485372openalex-snapshot
Graph partitioning using learning automata
inferred← citeshttps://doi.org/10.1109/12.762522openalex-snapshot
Greedy, prohibition, and reactive heuristics for graph partitioning
inferred← citeshttps://doi.org/10.1109/25.892573openalex-snapshot
Cell planning with capacity expansion in mobile communications: a tabu search approach
inferred← citeshttps://doi.org/10.1109/bmei.2011.6098669openalex-snapshot
A novel coarsening scheme for multilevel graph partitiong
inferred← citeshttps://doi.org/10.1109/comst.2017.2650979openalex-snapshot
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icct.2006.341759openalex-snapshot
An Overlay Multicast to Minimize End-to-end Delay in IP Networks
inferred← citeshttps://doi.org/10.1109/icecs.2002.1046290openalex-snapshot
A new assignment algorithm for star network topology design
inferred← citeshttps://doi.org/10.1109/icet58434.2023.10211575openalex-snapshot
A Partitioning Algorithm Based-on Vertex-degree of Undirected Graph for VLSI Circuit Simulations
inferred← citeshttps://doi.org/10.1109/icnp.2019.8888047openalex-snapshot
Graph-based Namespaces and Load Sharing for Efficient Information Dissemination in Disasters
inferred← citeshttps://doi.org/10.1109/icnp52444.2021.9651911openalex-snapshot
pMACH: Power and Migration Aware Container scHeduling
inferred← citeshttps://doi.org/10.1109/tc.2007.70760openalex-snapshot
A PROBE-Based Heuristic for Graph Partitioning
inferred← citeshttps://doi.org/10.1109/tevc.2011.2136346openalex-snapshot
A Multilevel Memetic Approach for Improving Graph k-Partitions
inferred← citeshttps://doi.org/10.1109/tnet.2021.3094839openalex-snapshot
Graph-Based Namespaces and Load Sharing for Efficient Information Dissemination
inferred← citeshttps://doi.org/10.1109/wimob.2007.4390850openalex-snapshot
An Entropy-Based Weighted Clustering Algorithm and Its Optimization for Ad Hoc Networks
inferred← citeshttps://doi.org/10.1145/2001576.2001642openalex-snapshot
Genetic approaches for graph partitioning
inferred← citeshttps://doi.org/10.1145/3580282openalex-snapshot
Distributed Size-constrained Clustering Algorithm for Modular Robot-based Programmable Matter
inferred← citeshttps://doi.org/10.1155/2015/238529openalex-snapshot
Moving Clusters within a Memetic Algorithm for Graph Partitioning
inferred← citeshttps://doi.org/10.1155/2016/3690474openalex-snapshot
A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph
inferred← citeshttps://doi.org/10.1177/0037549706075479openalex-snapshot
Cost-based Partitioning for Distributed and Parallel Simulation of Decomposable Multiscale Constructive Models
inferred← citeshttps://doi.org/10.1287/ijoc.12.3.177.12637openalex-snapshot
Solving Graph Bisection Problems with Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/ijoc.7.4.426openalex-snapshot
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
inferred← citeshttps://doi.org/10.1371/journal.pone.0197103openalex-snapshot
Graph drawing using tabu search coupled with path relinking
inferred← citeshttps://doi.org/10.20965/jaciii.2019.p0005openalex-snapshot
Computational Comparison of Major Proposed Methods for Graph Partitioning Problem
inferred← citeshttps://doi.org/10.3390/en81011315openalex-snapshot
A Tabu Search Algorithm for the Power System Islanding Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/aef.1.257openalex-snapshot
Local Refinement for Graph Partitioning Based on Level Structure
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.427-429.2395openalex-snapshot
Optical Distribution Network Partitioning Method Based on Tabu Search
inferred← citeshttps://doi.org/10.4304/jcp.9.8.1886-1896openalex-snapshot
A Vertex Separator-based Algorithm for Hypergraph Bipartitioning
inferred← citeshttps://doi.org/10.47749/t/unicamp.2004.322316openalex-snapshot
Metaheuristicas aplicadas ao planejamento da expansão da transmissão de energia eletrica em ambientes de processamento distribuido
inferred← citeshttps://doi.org/10.5445/ir/1000035713openalex-snapshot
High Quality Graph Partitioning
inferred← citeshttps://doi.org/10.5755/j01.itc.30.1.11799openalex-snapshot
AN OVERVIEW OF SOME HEURISTIC ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.5755/j01.itc.34.3.12016openalex-snapshot
EXPERIMENTS WITH TABU SEARCH FOR RANDOM QUADRATIC ASSIGNMENT PROBLEMS
inferred← citeshttps://doi.org/10.5755/j01.itc.35.3.11770openalex-snapshot
ITERATED TABU SEARCH: AN IMPROVEMENT TO STANDARD TABU SEARCH
inferred← citeshttps://doi.org/10.7763/ijcce.2014.v3.297openalex-snapshot
Applying a Parallel Solution to the Graph Partitioning Problem in the Simulation of Multiphase Flows
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.