On the public citation graph
Hybridizations of GRASP with path relinking for the far from most string problem
0 signed · 55 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/net.1023openalex-snapshot
Local search with perturbations for the prize‐collecting Steiner tree problem in graphs
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/978-1-4615-1507-4_15openalex-snapshot
Grasp: An Annotated Bibliography
inferredcites →https://doi.org/10.1007/978-1-4615-4102-8openalex-snapshot
Interfaces in Computer Science and Operations Research
inferredcites →https://doi.org/10.1007/978-1-4615-4102-8_1openalex-snapshot
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
inferredcites →https://doi.org/10.1007/978-1-4615-4567-5_1openalex-snapshot
Multi-Start and Strategic Oscillation Methods — Principles to Exploit Adaptive Memory
inferredcites →https://doi.org/10.1007/978-3-642-38516-2_14openalex-snapshot
Hybrid Metaheuristics for the Far From Most String Problem
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/s10732-011-9167-1openalex-snapshot
Path-relinking intensification methods for stochastic local search algorithms
inferredcites →https://doi.org/10.1007/s10732-011-9177-zopenalex-snapshot
An improved heuristic for the far from most strings problem
inferredcites →https://doi.org/10.1007/s10898-011-9769-zopenalex-snapshot
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
inferredcites →https://doi.org/10.1016/0167-6377(89)90002-3openalex-snapshot
A probabilistic heuristic for a computationally difficult set covering problem
inferredcites →https://doi.org/10.1016/j.cor.2008.05.011openalex-snapshot
GRASP and path relinking for the max–min diversity problem
inferredcites →https://doi.org/10.1016/j.mbs.2006.11.012openalex-snapshot
On some optimization problems in molecular biology
inferredcites →https://doi.org/10.1016/j.parco.2006.11.007openalex-snapshot
Efficient parallel cooperative implementations of GRASP heuristics
inferredcites →https://doi.org/10.1016/s0890-5401(03)00057-9openalex-snapshot
Distinguishing string selection problems
inferredcites →https://doi.org/10.1016/s1570-8667(03)00011-xopenalex-snapshot
The consensus string problem for a metric is NP-complete
inferredcites →https://doi.org/10.1023/a:1015061802659openalex-snapshot
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
inferredcites →https://doi.org/10.1023/b:heur.0000019986.96257.50openalex-snapshot
A Hybrid Heuristic for the p-Median Problem
inferredcites →https://doi.org/10.1080/1055678021000090033openalex-snapshot
Randomized heuristics for the Max-Cut problem
inferredcites →https://doi.org/10.1109/memb.2005.1436464openalex-snapshot
Optimization techniques for string selection and comparison problems in genomics
inferredcites →https://doi.org/10.1109/tpwrs.2004.835627openalex-snapshot
Power Transmission Network Design by Greedy Randomized Adaptive Path Relinking
inferredcites →https://doi.org/10.1111/itor.12026openalex-snapshot
Randomized heuristics for the family traveling salesperson problem
inferredcites →https://doi.org/10.1111/itor.12086openalex-snapshot
Analysis and design of peer‐assisted video‐on‐demand services
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00663.xopenalex-snapshot
An annotated bibliography of GRASP – Part I: Algorithms
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00664.xopenalex-snapshot
An annotated bibliography of GRASP–Part II: Applications
inferredcites →https://doi.org/10.1111/j.1475-3995.2011.00827.xopenalex-snapshot
Solving a bus driver scheduling problem with randomized multistart heuristics
inferredcites →https://doi.org/10.1145/1187436.1187439openalex-snapshot
Cache-efficient string sorting using copying
inferredcites →https://doi.org/10.1145/1187436.1216581openalex-snapshot
GRASP with path relinking for the weighted MAXSAT problem
inferredcites →https://doi.org/10.1145/301250.301376openalex-snapshot
Finding similar regions in many strings
inferredcites →https://doi.org/10.1287/ijoc.11.1.44openalex-snapshot
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
inferredcites →https://doi.org/10.1287/ijoc.12.1.24.11899openalex-snapshot
Statistical Analysis of Computational Tests of Algorithms and Heuristics
inferredcites →https://doi.org/10.2307/3001968openalex-snapshot
Individual Comparisons by Ranking Methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-30035-6_6openalex-snapshot
Application of Negative Learning Ant Colony Optimization to the Far from Most String Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_58openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_58-2openalex-snapshot
Selected String Problems
inferred← citeshttps://doi.org/10.1007/s10878-019-00411-3openalex-snapshot
Hybrid algorithms for placement of virtual machines across geo-separated data centers
inferred← citeshttps://doi.org/10.1007/s11750-025-00696-0openalex-snapshot
GRASP: an application to efficiently plan the low carbon emission distributed additive manufacturing
inferred← citeshttps://doi.org/10.1007/s44196-024-00488-7openalex-snapshot
Extension of CMSA with a Learning Mechanism: Application to the Far from Most String Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2017.09.032openalex-snapshot
A GRASP with iterated local search for the traveling repairman problem with profits
inferred← citeshttps://doi.org/10.1080/10556788.2018.1548015openalex-snapshot
An efficient exact approach for the constrained shortest path tour problem
inferred← citeshttps://doi.org/10.1111/itor.12419openalex-snapshot
A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
inferred← citeshttps://doi.org/10.1111/itor.13164openalex-snapshot
On the role of metaheuristic optimization in bioinformatics
inferred← citeshttps://doi.org/10.1155/2016/9109824openalex-snapshot
Analyzing the Performance of a Hybrid Heuristic for Solving a Bilevel Location Problem under Different Approaches to Tackle the Lower Level
inferred← citeshttps://doi.org/10.1155/2020/3050714openalex-snapshot
Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic
inferred← citeshttps://doi.org/10.1155/2021/8741454openalex-snapshot
A Visual Grasping Strategy for Improving Assembly Efficiency Based on Deep Reinforcement Learning
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.