On the public citation graph
Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
0 signed · 53 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.21587openalex-snapshot
Timing problems and algorithms: Time decisions for sequences of activities
inferredcites →https://doi.org/10.1002/net.3230200605openalex-snapshot
Time‐dependent traveling salesman problem–the deliveryman case
inferredcites →https://doi.org/10.1002/net.3230230202openalex-snapshot
The traveling salesman problem with cumulative costs
inferredcites →https://doi.org/10.1002/sam.10116openalex-snapshot
A hybrid data mining metaheuristic for thep‐median problem
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/11546245_11openalex-snapshot
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_18openalex-snapshot
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/s10288-011-0153-0openalex-snapshot
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
inferredcites →https://doi.org/10.1007/s10288-012-0212-1openalex-snapshot
Variable neighborhood search for the travelling deliveryman problem
inferredcites →https://doi.org/10.1007/s10479-014-1693-4openalex-snapshot
Making a state-of-the-art heuristic faster with data mining
inferredcites →https://doi.org/10.1007/s10732-013-9231-0openalex-snapshot
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic
inferredcites →https://doi.org/10.1007/s10852-005-9030-1openalex-snapshot
Hybridization of GRASP Metaheuristic with Data Mining Techniques
inferredcites →https://doi.org/10.1007/s11590-006-0031-4openalex-snapshot
TTT plots: a perl program to create time-to-target plots
inferredcites →https://doi.org/10.1016/j.apm.2012.05.026openalex-snapshot
Two improved formulations for the minimum latency problem
inferredcites →https://doi.org/10.1016/j.cor.2009.06.014openalex-snapshot
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
inferredcites →https://doi.org/10.1016/j.cor.2009.10.011openalex-snapshot
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
inferredcites →https://doi.org/10.1016/j.cor.2012.02.022openalex-snapshot
A hybrid data mining GRASP with path-relinking
inferredcites →https://doi.org/10.1016/j.cor.2018.01.016openalex-snapshot
A branch-and-price algorithm for the Minimum Latency Problem
inferredcites →https://doi.org/10.1016/j.dam.2008.05.009openalex-snapshot
A new formulation for the Traveling Deliveryman Problem
inferredcites →https://doi.org/10.1016/j.disopt.2010.06.002openalex-snapshot
The Delivery Man Problem with time windows
inferredcites →https://doi.org/10.1016/j.ejor.2012.03.044openalex-snapshot
A simple and effective metaheuristic for the Minimum Latency Problem
inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-snapshot
Variable neighborhood search
inferredcites →https://doi.org/10.1023/a:1016540724870openalex-snapshot
A Taxonomy of Hybrid Metaheuristics
inferredcites →https://doi.org/10.1051/ita/1986200100791openalex-snapshot
The complexity of the travelling repairman problem
inferredcites →https://doi.org/10.1109/glocom.2006.246openalex-snapshot
NGL01-4: A Hybrid GRASP with Data Mining for Efficient Server Replication for Reliable Multicast
inferredcites →https://doi.org/10.1109/sfcs.2003.1238179openalex-snapshot
Paths, trees, and minimum latency tours
inferredcites →https://doi.org/10.1111/exsy.12158openalex-snapshot
Efficient representative pattern mining based on weight and maximality conditions
inferredcites →https://doi.org/10.1137/1.9781611972795.27openalex-snapshot
A Hybrid Data Mining Metaheuristic for the p-Median Problem
inferredcites →https://doi.org/10.1137/1.9781611973075.36openalex-snapshot
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1287/opre.41.6.1055openalex-snapshot
The Delivery Man Problem and Cumulative Matroids
inferredcites →https://doi.org/10.1287/trsc.2013.0474openalex-snapshot
Dynamic ng-Path Relaxation for the Delivery Man Problem
inferredcites →https://doi.org/10.17632/sxz37ssdbc.2openalex-snapshot
Experimental data from 'Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining'
inferredcites →https://doi.org/10.3233/ida-160860openalex-snapshot
Extending the hybridization of metaheuristics with data mining: Dealing with sequences
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.2139/ssrn.4690805openalex-extracted
Hybrid Discrete Bacterial Memetic Evolutionary Algorithm for Solving the Traveling Repairman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-97874-7_14openalex-snapshot
Virtual Reality Video CU Partition Fast System Based on Dynamic Selection Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_7openalex-snapshot
MineReduce-Based Metaheuristic for the Minimum Latency Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-38310-6_13openalex-snapshot
Data Mining in Heuristic Search
inferred← citeshttps://doi.org/10.1007/s10100-021-00793-yopenalex-snapshot
Solving the traveling delivery person problem with limited computational time
inferred← citeshttps://doi.org/10.1007/s10586-020-03173-4openalex-snapshot
Parallel deterministic local search heuristic for minimum latency problem
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.1016/j.ejco.2025.100121openalex-snapshot
MineReduce-based heuristic for the maximum diversity problem
inferred← citeshttps://doi.org/10.1051/ro/2021057openalex-snapshot
Reactive GRASP for the Prize-collecting Covering Tour Problem
inferred← citeshttps://doi.org/10.1109/case59546.2024.10711366openalex-snapshot
Effective Searching for the Honeybee Queen in a Living Colony
inferred← citeshttps://doi.org/10.26599/tst.2024.9010164openalex-snapshot
A Deep Reinforcement Learning-Based Self-Repair Method for Solving the Agile Satellite Scheduling Problem
inferred← citeshttps://doi.org/10.3934/mbe.2023542openalex-snapshot
A point-feature label placement algorithm based on spatial data mining
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.