Skip to search formSkip to main contentSkip to account menu

Very large-scale neighborhood search

In mathematical optimization, neighborhood search is a technique that tries to find good or near-optimal solutions to a combinatorial optimisation… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in… 
2012
2012
Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of… 
2011
2011
Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions… 
2011
2011
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is… 
2008
2008
A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an… 
Review
2008
Review
2008
Summary. Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this… 
2007
2007
The quadratic assignment problem (QAP) consists of assigning n facilities to n locations to minimize the total weighted cost of… 
Review
2007
Review
2007
Many optimization problems that model the essential issues of important real-world decision making are computationally…