On the public citation graph
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
0 signed · 36 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.10105openalex-snapshot
The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm
inferredcites →https://doi.org/10.1002/net.3230260407openalex-snapshot
On the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/s10479-006-0153-1openalex-snapshot
On the prize-collecting generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1007/s10732-007-9027-1openalex-snapshot
The prize-collecting generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1007/s10732-007-9047-xopenalex-snapshot
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.cor.2015.06.012openalex-snapshot
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.ejor.2004.07.058openalex-snapshot
A new relaxation method for the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.ejor.2007.08.021openalex-snapshot
A tabu search heuristic for the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.ejor.2017.08.015openalex-snapshot
A two-level solution approach for solving the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.ejor.2019.05.017openalex-snapshot
The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances
inferredcites →https://doi.org/10.1016/j.eswa.2011.09.043openalex-snapshot
A GRASP-based approach to the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.eswa.2015.12.014openalex-snapshot
A multi-operator genetic algorithm for the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/j.swevo.2011.02.002openalex-snapshot
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(98)00090-0openalex-snapshot
Class Steiner trees and VLSI-design
inferredcites →https://doi.org/10.1016/s0377-2217(02)00213-8openalex-snapshot
Relaxation methods for the generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1016/s0377-2217(99)00006-5openalex-snapshot
Generalized spanning trees
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1111/itor.12680openalex-snapshot
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
inferredcites →https://doi.org/10.1111/itor.12725openalex-snapshot
A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
inferredcites →https://doi.org/10.1111/itor.12853openalex-snapshot
Solving the prize‐collecting Euclidean Steiner tree problem
inferredcites →https://doi.org/10.1287/ijoc.1040.0077openalex-snapshot
Heuristic Search for the Generalized Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1287/ijoc.3.4.376openalex-snapshot
TSPLIB—A Traveling Salesman Problem Library
inferredcites →https://doi.org/10.1287/opre.45.3.378openalex-snapshot
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
inferredcites →https://doi.org/10.1613/jair.2861openalex-snapshot
ParamILS: An Automatic Algorithm Configuration Framework
inferredcites →https://doi.org/10.5281/zenodo.4008686openalex-snapshot
contrerasbolton/PC-GMSTP-ILS: First Release
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.4850484openalex-extracted
A Quantitative Evaluation of Statistical Practices in Metaheuristics Research
inferred← citeshttps://doi.org/10.1002/net.22099openalex-snapshot
Continuous approximation formulas for location problems
inferred← citeshttps://doi.org/10.1007/s11750-025-00699-xopenalex-snapshot
Iterated local search, iterated greedy and applications
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.112971openalex-snapshot
A novel three-stage matheuristic for the capacitated minimum spanning tree problem with time windows
inferred← citeshttps://doi.org/10.1016/j.swevo.2024.101664openalex-snapshot
An Adaptive Multi-Meme Memetic Algorithm for the prize-collecting generalized minimum spanning tree problem
inferred← citeshttps://doi.org/10.1111/itor.13428openalex-snapshot
Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
inferred← citeshttps://doi.org/10.3390/math11194214openalex-snapshot
Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem
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.