Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,489,275 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
4 relations
List of RNA structure prediction software
Local search (optimization)
Mathematical optimization
Tabu search
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations
A. Ghoniem
,
Tulay Flamand
,
M. Haouari
INFORMS J. Comput.
2016
Corpus ID: 207225343
This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in…
Expand
Review
2015
Review
2015
A survey of variants and extensions of the location-routing problem
Michael Drexl
,
Michael Schneider
Eur. J. Oper. Res.
2015
Corpus ID: 15987605
2012
2012
Very large-scale neighborhood search algorithms for the design of service overlay networks
J. Elias
,
F. Martignon
,
G. Carello
Telecommun. Syst.
2012
Corpus ID: 8923934
Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of…
Expand
2011
2011
Constraint-based Very Large-Scale Neighborhood search
Sébastien Mouthuy
,
Pascal Van Hentenryck
,
Y. Deville
Constraints
2011
Corpus ID: 13008012
Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions…
Expand
2011
2011
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
T. Lust
,
J. Teghem
,
D. Tuyttens
EMO
2011
Corpus ID: 27971464
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is…
Expand
2008
2008
Very large-scale neighborhood search : Theory , algorithms and applications
R. Ahuja
2008
Corpus ID: 18608428
A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an…
Expand
Review
2008
Review
2008
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
Marco Chiarandini
,
I. Dumitrescu
,
T. Stützle
Hybrid Metaheuristics
2008
Corpus ID: 9223415
Summary. Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this…
Expand
2007
2007
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
R. Ahuja
,
Krishna C. Jha
,
J. Orlin
,
Dushyant Sharma
INFORMS J. Comput.
2007
Corpus ID: 2871750
The quadratic assignment problem (QAP) consists of assigning n facilities to n locations to minimize the total weighted cost of…
Expand
Review
2007
Review
2007
Very Large-Scale Neighborhood Search
Özlem Ergun
,
Abraham P. Punnen
,
J. Orlin
,
R. Ahuja
Handbook of Approximation Algorithms and…
2007
Corpus ID: 15221322
Many optimization problems that model the essential issues of important real-world decision making are computationally…
Expand
Review
2002
Review
2002
A survey of very large-scale neighborhood search techniques
R. Ahuja
,
Özlem Ergun
,
J. Orlin
,
Abraham P. Punnen
Discret. Appl. Math.
2002
Corpus ID: 1946785
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE