FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2015
024620022015

Related topics

Related topics

4 relations
List of RNA structure prediction softwareLocal search (optimization)Mathematical optimizationTabu search

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Very large-scale neighborhood search
Mathematical optimization
Local search (optimization)
Tabu search
List of RNA structure prediction software

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Very large-scale neighborhood search algorithms for the design of service overlay networks
Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
Constraint-based Very Large-Scale Neighborhood search
Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2011
2011
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems
Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2007
2007
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted… (More)
  • figure 1
  • figure 6
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
2007
2007
Very Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult… (More)
Is this relevant?
2007
2007
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model
The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Very Large-Scale Neighborhood Search Techniques in Timetabling Problems
We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail… (More)
  • figure 1
Is this relevant?
2004
2004
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
We propose a metaheuristic algorithm for the multi-resource generalized<lb>assignment problem (MRGAP). MRGAP is a generalization… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Review
2002
Review
2002
A survey of very large-scale neighborhood search techniques
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
2002
2002
A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model
The fleet assignment model (FAM) for an airline assigns fleet types to the set of flight legs that satisfies a variety of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?