On the public citation graph
Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows
0 signed · 42 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.3230190511openalex-snapshot
The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 pp
inferredcites →https://doi.org/10.1007/978-3-030-15843-9openalex-snapshot
Variable Neighborhood Search
inferredcites →https://doi.org/10.1007/978-3-030-15843-9_6openalex-snapshot
Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem
inferredcites →https://doi.org/10.1007/978-3-319-56246-9_23openalex-snapshot
A Quantum Inspired GVNS: Some Preliminary Results
inferredcites →https://doi.org/10.1007/978-3-540-73297-6_2openalex-snapshot
Quantum-Inspired Evolutionary Algorithm for Numerical Optimization
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/bf02022044openalex-snapshot
Local search in routing problems with time windows
inferredcites →https://doi.org/10.1007/pl00011432openalex-snapshot
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
inferredcites →https://doi.org/10.1007/s00500-013-1203-7openalex-snapshot
A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems
inferredcites →https://doi.org/10.1007/s10845-011-0568-7openalex-snapshot
Design of an improved quantum-inspired evolutionary algorithm for a transportation problem in logistics systems
inferredcites →https://doi.org/10.1007/s11047-013-9401-xopenalex-snapshot
Computation of the travelling salesman problem by a shrinking blob
inferredcites →https://doi.org/10.1007/s13675-016-0075-xopenalex-snapshot
Variable neighborhood search: basics and variants
inferredcites →https://doi.org/10.1016/j.compchemeng.2019.04.015openalex-snapshot
A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing
inferredcites →https://doi.org/10.1016/j.cor.2012.05.009openalex-snapshot
Variable neighborhood search for location routing
inferredcites →https://doi.org/10.1016/j.disopt.2010.04.002openalex-snapshot
A General VNS heuristic for the traveling salesman problem with time windows
inferredcites →https://doi.org/10.1016/j.dss.2018.10.010openalex-snapshot
Spatial Decision Support Systems: Three decades on
inferredcites →https://doi.org/10.1016/j.endm.2012.10.012openalex-snapshot
An efficient GVNS for solving Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.1016/j.endm.2014.11.010openalex-snapshot
General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
inferredcites →https://doi.org/10.1016/j.ijpe.2014.10.003openalex-snapshot
Variable neighborhood search for the economic lot sizing problem with product returns and recovery
inferredcites →https://doi.org/10.1016/j.ins.2015.07.044openalex-snapshot
Less is more: Basic variable neighborhood search for minimum differential dispersion problem
inferredcites →https://doi.org/10.1016/j.mcm.2006.11.035openalex-snapshot
A modified ant colony system for solving the travelling salesman problem with time windows
inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-snapshot
Variable neighborhood search
inferredcites →https://doi.org/10.1080/02693799308901962openalex-snapshot
Guest Editorial Latest developments in GIS/LIS
inferredcites →https://doi.org/10.1109/icit.2004.1490730openalex-snapshot
A new quantum-inspired genetic algorithm for solving the travelling salesman problem
inferredcites →https://doi.org/10.1109/iisa.2015.7388106openalex-snapshot
Initialization methods for the TSP with Time Windows using Variable Neighborhood Search
inferredcites →https://doi.org/10.1109/tevc.2008.2003010openalex-snapshot
Quantum-Inspired Evolutionary Algorithm: A Multimodel EDA
inferredcites →https://doi.org/10.1145/2740908.2742134openalex-snapshot
Architecture and Implementation Issues, Towards a Dynamic Waste Collection Management System
inferredcites →https://doi.org/10.1287/ijoc.1050.0145openalex-snapshot
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.1030.0079openalex-snapshot
Traveling Salesman Problems with Profits
inferredcites →https://doi.org/10.1287/trsc.34.1.113.12284openalex-snapshot
A New Heuristic for the Traveling Salesman Problem with Time Windows
inferredcites →https://doi.org/10.3390/a11040038openalex-snapshot
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
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-030-78775-2_15openalex-snapshot
Nature and Quantum-Inspired Procedures – A Short Literature Review
inferred← citeshttps://doi.org/10.1016/j.robot.2026.105685openalex-snapshot
A convex hull cheapest insertion heuristic for the non-Euclidean TSP
inferred← citeshttps://doi.org/10.1109/icaccs60874.2024.10717235openalex-snapshot
Optimization Garbage Collection Routes Using Lorentz Quantum Particle Swarm Optimization: ESPOL Case Study
inferred← citeshttps://doi.org/10.1109/octa49274.2020.9151669openalex-snapshot
General Variable Neighborhood Search Approach for Solving the Electric Two-Echelon Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1117/12.3021510openalex-snapshot
Image recognition model building in the context of municipal waste classification
inferred← citeshttps://doi.org/10.20944/preprints202011.0150.v1openalex-snapshot
DKPRG or How to Succeed in the Kolkata Paise Restaurant Game via TSP
inferred← citeshttps://doi.org/10.21276/ijircst.2020.8.6.5openalex-snapshot
On the Feasibility of Handling Uncertainty in SPARQL Queries in the Case of Sparse Graphs
inferred← citeshttps://doi.org/10.3390/a12110224openalex-snapshot
A QUBO Model for the Traveling Salesman Problem with Time Windows
inferred← citeshttps://doi.org/10.3390/g13030033openalex-snapshot
The Distributed Kolkata Paise Restaurant Game
inferred← citeshttps://doi.org/10.3390/math10081294openalex-snapshot
Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems
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.