When subproblem binary-variable counts are matched, route-based LNS-K beats QUBO-structure-based LNS-Q on a 400-customer VRP and shifts its selected customers toward spatially localized sets.
Shaw: International Conference on Principles and Practice of Con- straint Programming, 1998, pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cond-mat.stat-mech 2years
2026 2verdicts
CONDITIONAL 2representative citing papers
Introducing a segment-length parameter into Ising-machine-assisted large neighborhood search for VRP yields ~10% better solutions than the prior method by enabling finer subproblem-size control.
citing papers explorer
-
Geometric Characteristics of Subproblems in Ising-Machine-Assisted Large Neighborhood Search
When subproblem binary-variable counts are matched, route-based LNS-K beats QUBO-structure-based LNS-Q on a 400-customer VRP and shifts its selected customers toward spatially localized sets.
-
Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size
Introducing a segment-length parameter into Ising-machine-assisted large neighborhood search for VRP yields ~10% better solutions than the prior method by enabling finer subproblem-size control.