On the public citation graph

Parallel local search

0 signed · 199 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.1002/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
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.3230230804openalex-snapshot
Parallel iterative search methods for vehicle routing problems
inferredcites →https://doi.org/10.1007/3-540-45612-0_1openalex-snapshot
Meta-heuristics: The State of the Art
inferredcites →https://doi.org/10.1007/3-540-52282-4_52openalex-snapshot
The analysis of local search problems and their heuristics
inferredcites →https://doi.org/10.1007/978-1-4613-1361-8_36openalex-snapshot
A Probabilistic Analysis of Local Search
inferredcites →https://doi.org/10.1007/978-1-4613-1697-8openalex-snapshot
VLSI Placement and Global Routing Using Simulated Annealing
inferredcites →https://doi.org/10.1007/978-3-642-46787-5openalex-snapshot
Applied Simulated Annealing
inferredcites →https://doi.org/10.1007/978-3-642-46787-5_2openalex-snapshot
Problem Independent Distributed Simulated Annealing and its Applications
inferredcites →https://doi.org/10.1007/978-3-662-02830-8openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/bf01719254openalex-snapshot
Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
inferredcites →https://doi.org/10.1007/bf01759049openalex-snapshot
A theoretical framework for simulated annealing
inferredcites →https://doi.org/10.1007/bf02022093openalex-snapshot
Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
inferredcites →https://doi.org/10.1007/bf02022562openalex-snapshot
Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
inferredcites →https://doi.org/10.1007/bf02022564openalex-snapshot
An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
inferredcites →https://doi.org/10.1007/bf02022999openalex-snapshot
Massively parallel tabu search for the quadratic assignment problem
inferredcites →https://doi.org/10.1007/bf02078647openalex-snapshot
A user's guide to tabu search
inferredcites →https://doi.org/10.1007/bf02125458openalex-snapshot
Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
inferredcites →https://doi.org/10.1007/bfb0027029openalex-snapshot
Local search in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0029723openalex-snapshot
Parallel Problem Solving from Nature
inferredcites →https://doi.org/10.1007/bfb0032050openalex-snapshot
Local optimization and the Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0141-9331(92)90003-copenalex-snapshot
Parallel biased search for combinatorial optimization: genetic algorithms and TABU
inferredcites →https://doi.org/10.1016/0141-9331(92)90038-uopenalex-snapshot
Parallel techniques for solving large scale travelling salesperson problems
inferredcites →https://doi.org/10.1016/0165-6074(90)90222-uopenalex-snapshot
An Occam-based evaluation of a parallel version of simulated annealing
inferredcites →https://doi.org/10.1016/0166-218x(92)00033-iopenalex-snapshot
A parallel tabu search algorithm for large traveling salesman problems
inferredcites →https://doi.org/10.1016/0166-218x(93)90047-ropenalex-snapshot
Sequential and parallel local search for the time-constrained traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-2789(90)90084-3openalex-snapshot
Parallel simulated annealing techniques
inferredcites →https://doi.org/10.1016/0167-739x(94)00059-nopenalex-snapshot
A parallel 2-opt algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0167-8191(88)90098-1openalex-snapshot
Evolution algorithms in combinatorial optimization
inferredcites →https://doi.org/10.1016/0167-8191(89)90106-3openalex-snapshot
A distributed implementation of simulated annealing for the travelling salesman problem
inferredcites →https://doi.org/10.1016/0167-8191(90)90063-fopenalex-snapshot
Slow annealing versus multiple fast annealing runs — an empirical investigation
inferredcites →https://doi.org/10.1016/0167-8191(94)00071-hopenalex-snapshot
Parallel recombinative simulated annealing: A genetic algorithm
inferredcites →https://doi.org/10.1016/0167-9260(86)90002-7openalex-snapshot
Parallel implementations of the statistical cooling algorithm
inferredcites →https://doi.org/10.1016/0304-3975(90)90192-kopenalex-snapshot
A complexity theory of efficient parallel algorithms
inferredcites →https://doi.org/10.1016/0305-0548(94)90073-6openalex-snapshot
A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints
inferredcites →https://doi.org/10.1016/0377-2217(90)90090-xopenalex-snapshot
Some efficient heuristic methods for the flow shop sequencing problem
inferredcites →https://doi.org/10.1016/0743-7315(89)90067-1openalex-snapshot
A distributed implementation of simulated annealing
inferredcites →https://doi.org/10.1016/0743-7315(91)90074-jopenalex-snapshot
Parallelism in graph-partitioning
inferredcites →https://doi.org/10.1016/0898-1221(93)90275-zopenalex-snapshot
Bounding the probability of success of stochastic methods for global optimization
inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50034-4openalex-snapshot
PARALLEL GENETIC ALGORITHMS IN COMBINATORIAL OPTIMIZATION
inferredcites →https://doi.org/10.1016/c2009-0-07972-0openalex-snapshot
Computer Science and Operations Research
inferredcites →https://doi.org/10.1016/s0167-8191(05)80107-3openalex-snapshot
Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections
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.1016/s0305-0548(97)00093-2openalex-snapshot
A local search template
inferredcites →https://doi.org/10.1051/jphys:019850046080127700openalex-snapshot
Configuration space analysis of travelling salesman problems
inferredcites →https://doi.org/10.1109/43.3172openalex-snapshot
Parallel standard cell placement algorithms with quality equivalent to simulated annealing
inferredcites →https://doi.org/10.1109/43.57790openalex-snapshot
A problem independent parallel implementation of simulated annealing: models and experiments
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tcad.1987.1270301openalex-snapshot
Placement by Simulated Annealing on a Multiprocessor
inferredcites →https://doi.org/10.1109/tcad.1987.1270327openalex-snapshot
A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1142/9789812798190_0017openalex-snapshot
Tabu Search: Applications and Prospects
inferredcites →https://doi.org/10.1145/103724.103725openalex-snapshot
VLSI cell placement techniques
inferredcites →https://doi.org/10.1145/152941.1064724openalex-snapshot
Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992)
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1147/rd.313.0391openalex-snapshot
Parallel algorithms for chip placement by simulated annealing
inferredcites →https://doi.org/10.1287/ijoc.1.3.190openalex-snapshot
Tabu Search—Part I
inferredcites →https://doi.org/10.1287/ijoc.3.3.213openalex-snapshot
A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
inferredcites →https://doi.org/10.1287/ijoc.6.2.108openalex-snapshot
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
inferredcites →https://doi.org/10.1287/mnsc.37.1.98openalex-snapshot
Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.20532/citopenalex-snapshot
Journal of Computing and Information Technology
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.6083/nk322d67mopenalex-snapshot
Large-step Markov chains for the Traveling Salesman Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471739383.ch14openalex-snapshot
Parallel Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1002/9780470496916.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781118600283.ch8openalex-snapshot
Parallel Combinatorial Optimization
inferred← citeshttps://doi.org/10.1002/9781119005384.biblioopenalex-snapshot
General Bibliography
inferred← citeshttps://doi.org/10.1002/9781119005384.ch8openalex-snapshot
Parallel Combinatorial Optimization
inferred← citeshttps://doi.org/10.1002/cpe.1855openalex-snapshot
Targeting the Cell Broadband Engine for constraint‐based local search
inferred← citeshttps://doi.org/10.1002/int.20363openalex-snapshot
A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems
inferred← citeshttps://doi.org/10.1002/spe.524openalex-snapshot
E ASY L OCAL++ : an object‐oriented framework for the flexible design of local‐search algorithms
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_1openalex-snapshot
Scatter Search and Path Relinking: Advances and Applications
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_17openalex-snapshot
Parallel Strategies for Meta-Heuristics
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/0-387-23667-8_13openalex-snapshot
Parallel Computation, Co-operation, Tabu Search
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_14openalex-snapshot
Parallel Strategies for Grasp with Path-Relinking
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_1openalex-snapshot
Meta-heuristics: The State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_20openalex-snapshot
Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-71921-4_16openalex-snapshot
Exploring Grid Implementations of Parallel Cooperative Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_367openalex-snapshot
Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_8openalex-snapshot
Parallel Solution Methods for Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-1306-7_1openalex-snapshot
Metaheuristics: Intelligent Problem Solving
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_17openalex-snapshot
Parallel Meta-heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_9openalex-snapshot
SteinLib: An Updated Library on Steiner Tree Problems in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_8openalex-snapshot
Parallelized Heuristics for Combinatorial Search
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_1openalex-snapshot
Selected Topics in Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_10openalex-snapshot
Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_13openalex-snapshot
Strategies for the Parallel Implementation of Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_2openalex-snapshot
Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-5755-5_10openalex-snapshot
Parallel Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_26openalex-snapshot
An Experimental Study of Systemic Behavior of Cooperative Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_13openalex-snapshot
Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_7openalex-snapshot
Parallel Metaheuristics for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-6530-4_10openalex-snapshot
Parallel GRASP heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4939-6530-4_6openalex-snapshot
Runtime distributions
inferred← citeshttps://doi.org/10.1007/978-3-030-06222-4_1openalex-snapshot
Marketing Meets Data Science: Bridging the Gap
inferred← citeshttps://doi.org/10.1007/978-3-031-14721-0_39openalex-snapshot
Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_40openalex-snapshot
Parallel Metaheuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_40-1openalex-snapshot
Parallel Meta-heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_40-2openalex-snapshot
Parallel Meta-Heuristic Search
inferred← citeshttps://doi.org/10.1007/978-3-319-30698-8_17openalex-snapshot
Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-39636-1_4openalex-snapshot
Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_10openalex-snapshot
Parallel Local Search
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_17openalex-snapshot
Parallel Constraint-Based Local Search: An Application to Designing Resilient Long-Reach Passive Optical Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_7openalex-snapshot
A Decision Procedure for Equality Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-92695-5_8openalex-snapshot
Explicit and Emergent Cooperation Schemes for Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_2openalex-snapshot
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15211-5_28openalex-snapshot
Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture
inferred← citeshttps://doi.org/10.1007/978-3-642-20364-0_9openalex-snapshot
Experiments in Parallel Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-30671-6_1openalex-snapshot
A Unified Taxonomy of Hybrid Metaheuristics with Mathematical Programming, Constraint Programming and Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-31464-3_76openalex-snapshot
A Simulated Annealing Algorithm for GPU Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_30openalex-snapshot
Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_31openalex-snapshot
Constraint-Based Local Search for the Costas Array Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-44320-0_2openalex-snapshot
A Parametric Framework for Cooperative Parallel Local Search
inferred← citeshttps://doi.org/10.1007/bf00127079openalex-snapshot
Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control
inferred← citeshttps://doi.org/10.1007/bf02125421openalex-snapshot
Metaheuristics: A bibliography
inferred← citeshttps://doi.org/10.1007/s10288-013-0242-3openalex-snapshot
Combining metaheuristics with mathematical programming, constraint programming and machine learning
inferred← citeshttps://doi.org/10.1007/s10479-005-3971-7openalex-snapshot
Metaheuristics in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10479-015-2034-yopenalex-snapshot
Combining metaheuristics with mathematical programming, constraint programming and machine learning
inferred← citeshttps://doi.org/10.1007/s10601-014-9168-4openalex-snapshot
Large-scale parallelism for constraint-based local search: the costas array case study
inferred← citeshttps://doi.org/10.1007/s10732-015-9292-3openalex-snapshot
Estimating parallel runtimes for randomized algorithms in constraint solving
inferred← citeshttps://doi.org/10.1007/s10732-017-9342-0openalex-snapshot
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1007/s10766-013-0243-zopenalex-snapshot
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s10898-011-9769-zopenalex-snapshot
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
inferred← citeshttps://doi.org/10.1007/s11590-006-0031-4openalex-snapshot
TTT plots: a perl program to create time-to-target plots
inferred← citeshttps://doi.org/10.1007/s42979-022-01120-1openalex-snapshot
Defining Parallel Local Search Procedures with Neighborhood Combinators
inferred← citeshttps://doi.org/10.1016/j.apm.2008.05.019openalex-snapshot
Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms
inferred← citeshttps://doi.org/10.1016/j.cageo.2012.06.023openalex-snapshot
Nonlinear regression in environmental sciences by support vector machines combined with evolutionary strategy
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.015openalex-snapshot
A first multilevel cooperative algorithm for capacitated multicommodity network design
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105694openalex-snapshot
A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.08.011openalex-snapshot
An empirical investigation on parallelization strategies for Scatter Search
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104921openalex-snapshot
Large-scale and cooperative graybox parallel optimization on the supercomputer Fugaku
inferred← citeshttps://doi.org/10.1016/j.parco.2002.07.001openalex-snapshot
Systemic behavior of cooperative search algorithms
inferred← citeshttps://doi.org/10.1016/j.parco.2006.11.007openalex-snapshot
Efficient parallel cooperative implementations of GRASP heuristics
inferred← citeshttps://doi.org/10.1016/j.parco.2015.04.002openalex-snapshot
Parallel Local Search to schedule communicating tasks on identical processors
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00319-xopenalex-snapshot
Improved algorithms for the Steiner problem in networks
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00014-0openalex-snapshot
Parallel GRASP with path-relinking for job shop scheduling
inferred← citeshttps://doi.org/10.1017/s1471068413000392openalex-snapshot
Using sequential runtime distributions for the parallel speedup prediction of SAT local search
inferred← citeshttps://doi.org/10.1017/s1471068418000340openalex-snapshot
A review of literature on parallel constraint solving
inferred← citeshttps://doi.org/10.1023/a:1009627527067openalex-snapshot
Rescaled Simulated Annealing—Accelerating Convergence of Simulated Annealing by Rescaling the States Energies
inferred← citeshttps://doi.org/10.1023/a:1015061802659openalex-snapshot
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
inferred← citeshttps://doi.org/10.1023/a:1018908614375openalex-snapshot
Parallel local search for Steiner trees in graphs
inferred← citeshttps://doi.org/10.1023/b:heur.0000026897.40171.1aopenalex-snapshot
Cooperative Parallel Variable Neighborhood Search for the p-Median
inferred← citeshttps://doi.org/10.1080/02331934.2012.749258openalex-snapshot
Parallelization strategies for bee colony optimization based on message passing communication protocol
inferred← citeshttps://doi.org/10.1109/access.2024.3466170openalex-snapshot
The Role of Random Walk-Based Techniques in Enhancing Metaheuristic Optimization Algorithms—A Systematic and Comprehensive Review
inferred← citeshttps://doi.org/10.1109/cahpc.2005.40openalex-snapshot
Towards Grid Implementations of Metaheuristics for Hard Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1109/csae.2012.6272700openalex-snapshot
Resolution of multi-skilled workers assignment problem using simulation optimization: A case study
inferred← citeshttps://doi.org/10.1109/empdp.2000.823429openalex-snapshot
Parallel simulated annealing for the set-partitioning problem
inferred← citeshttps://doi.org/10.1109/empdp.2001.905046openalex-snapshot
Parallel simulated annealing for the delivery problem
inferred← citeshttps://doi.org/10.1109/empdp.2002.994313openalex-snapshot
Parallel simulated annealing for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1109/icpp.2013.25openalex-snapshot
Prediction of Parallel Speed-Ups for Las Vegas Algorithms
inferred← citeshttps://doi.org/10.1109/icsm.2003.1235430openalex-snapshot
Exploring software systems
inferred← citeshttps://doi.org/10.1109/ictai.2012.17openalex-snapshot
Massively Parallel Local Search for SAT
inferred← citeshttps://doi.org/10.1109/ictai.2016.0105openalex-snapshot
Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms
inferred← citeshttps://doi.org/10.1109/ijcnn.1998.685951openalex-snapshot
Rescaled simulated annealing
inferred← citeshttps://doi.org/10.1109/ijcnn.2012.6252383openalex-snapshot
Downscaling temperature and precipitation using support vector regression with evolutionary strategy
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370216openalex-snapshot
A Parallel Workflow for Real-time Correlation and Clustering of High-Frequency Stock Market Data
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161124openalex-snapshot
Multi-thread integrative cooperative optimization for rich combinatorial problems
inferred← citeshttps://doi.org/10.1109/ipdps.2011.357openalex-snapshot
Communication in Parallel Algorithms for Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.222openalex-snapshot
Parallel Local Search for the Costas Array Problem
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.211openalex-snapshot
Sequential and Parallel Restart Policies for Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.172openalex-snapshot
Dependent Walks in Parallel Local Search
inferred← citeshttps://doi.org/10.1109/pdp.2014.28openalex-snapshot
A GPU Implementation of Parallel Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1109/smc53654.2022.9945502openalex-snapshot
Multi-neighborhood Parallel Greedy Search Algorithm for Human-robot Collaborative Multi-product Hybrid Disassembly Line Balancing Problem
inferred← citeshttps://doi.org/10.1109/tpds.2024.3408030openalex-snapshot
CPLNS: Cooperative Parallel Large Neighborhood Search for Large-Scale Multi-Agent Path Finding
inferred← citeshttps://doi.org/10.1142/s0129626404001684openalex-snapshot
Parallel tabu search approaches for two-dimensional cutting
inferred← citeshttps://doi.org/10.1142/s0129626417500074openalex-snapshot
A Parallel Local Search Algorithm for Clustering Large Biological Networks
inferred← citeshttps://doi.org/10.1145/2145816.2145883openalex-snapshot
Performance analysis of parallel constraint-based local search
inferred← citeshttps://doi.org/10.1145/2370036.2145883openalex-snapshot
Performance analysis of parallel constraint-based local search
inferred← citeshttps://doi.org/10.1145/2554850.2555140openalex-snapshot
Flexible cooperation in parallel local search
inferred← citeshttps://doi.org/10.1186/1752-0509-4-17openalex-snapshot
Reverse engineering a gene network using an asynchronous parallel evolution strategy
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0059openalex-snapshot
GRASP with Path Relinking for Three-Index Assignment
inferred← citeshttps://doi.org/10.1287/ijoc.1060.0200openalex-snapshot
Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem
inferred← citeshttps://doi.org/10.1504/ijica.2007.016796openalex-snapshot
A selective approach to parallelise Bees Swarm Optimisation metaheuristic: application to MAX-W-SAT
inferred← citeshttps://doi.org/10.1504/ijscip.2012.050465openalex-snapshot
Rational swarm for global optimisation
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9360openalex-snapshot
Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization
inferred← citeshttps://doi.org/10.22028/d291-25729openalex-snapshot
Algorithms for the Steiner Problem in networks
inferred← citeshttps://doi.org/10.3990/1.9789036518925openalex-snapshot
Casual Multimedia Process Annotations - CoMPAs
inferred← citeshttps://doi.org/10.3990/1.9789036524100openalex-snapshot
A run-time reconfigurable Network-on-Chip for streaming DSP applications
inferred← citeshttps://doi.org/10.3990/1.9789036524766openalex-snapshot
Theories for Model-based Testing: Real-time and Coverage
inferred← citeshttps://doi.org/10.3990/1.9789090130866openalex-snapshot
Analysing industrial protocols with formal methods
inferred← citeshttps://doi.org/10.4018/978-1-4666-5784-7.ch011openalex-snapshot
Designing Parallel Meta-Heuristic Methods
inferred← citeshttps://doi.org/10.4114/ia.v11i34.912openalex-snapshot
Parallel cooperative strategies to solve optimization problems
inferred← citeshttps://doi.org/10.4114/ia.v7i19.716openalex-snapshot
GRASP: Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.6100/ir560086openalex-snapshot
Random redundant storage for video on demand
inferred← citeshttps://doi.org/10.6100/ir573763openalex-snapshot
Performance ratios for the differencing method
inferred← citeshttps://doi.org/10.6100/ir576805openalex-snapshot
Data synchronization and browsing for home environments
inferred← citeshttps://doi.org/10.6100/ir580445openalex-snapshot
Real-time scheduling for media processing using conditionally guaranteed budgets
inferred← citeshttps://doi.org/10.6100/ir580459openalex-snapshot
Indoor ultrasonic position estimation using a single base station
inferred← citeshttps://doi.org/10.6100/ir581264openalex-snapshot
Evolutionary agent-based economics
inferred← citeshttps://doi.org/10.6100/ir596314openalex-snapshot
Coalgebraic analysis of probabilistic systems
inferred← citeshttps://doi.org/10.6100/ir609596openalex-snapshot
Separation and adaptation of concerns in a shared data space
inferred← citeshttps://doi.org/10.6100/ir612838openalex-snapshot
Constructive formal methods and protocol standardization
inferred← citeshttps://doi.org/10.70675/02e94438z1a94z4bb0z9966z2a0088eb2df7openalex-snapshot
Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU)
inferred← citeshttps://doi.org/10.70675/0b722378z84aez40efz8aa7zdb565a620514openalex-snapshot
Solving Hard Combinatorial Optimization Problems using Cooperative Parallel Metaheuristics
inferred← citeshttps://doi.org/10.70675/3132197ezbf73z4ad9zb29fz20b8a8e35a63openalex-snapshot
Parallelisation of hybrid metaheuristics for COP solving
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.