Reference health
Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem
24/24 checkable references clean · checked 2026-07-25
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
3 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 24 checked references that resolve
resolves10.1016/0167-6377(94)90065-5
A new adaptive multi-start technique for combinatorial global optimizations
resolves10.1016/j.ins.2016.12.021
Less is more: Solving the Max-Mean diversity problem with variable neighborhood search
resolves10.1007/s10479-017-2601-5
Solving the capacitated clustering problem with variable neighborhood search
resolves10.1111/itor.12623
A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
resolves10.1016/j.ejor.2016.01.047
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem
resolves10.1111/itor.12540
A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
resolves10.1111/itor.12510
A parallel variable neighborhood search approach for the obnoxious<i>p</i>‐median problem
resolves10.1111/itor.12485
Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS
resolves10.1007/s10479-017-2508-1
Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
resolves10.1111/itor.12282
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
resolves10.1016/j.ins.2015.07.044
Less is more: Basic variable neighborhood search for minimum differential dispersion problem
resolves10.1111/itor.12509
Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
resolves10.1016/S0377-2217(97)00111-2
The obnoxious p facility network location problem with facility interaction
The 3 references without a DOI — listed, not checked
no DOI — not checkedA Survey on Obnoxious Facility Location Problems
no DOI — not checkedDongarra J.J. 2014.Performance of various computers using standard linear equations software. Technical report CS‐89‐85 University of Manchester Manchester UK.
no DOI — not checkedResende M.G. Werneck R.F. 2003.On the implementation of a swap‐based local search procedure for the p‐median problem.Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX03) pp.119–127.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-25 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1111/itor.12646"><img src="https://citestamp.com/citestamped/10.1111/itor.12646/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1111/itor.12646)