Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

4 relations
List of RNA structure prediction softwareLocal search (optimization)Mathematical optimizationTabu 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
This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in… Expand
  • figure 1
Is this relevant?
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… Expand
  • 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… Expand
  • figure 5.1
  • figure 7.1
  • table 7.1
  • figure 7.2
  • table 7.2
Is this relevant?
Review
2011
Review
2011
Very Large-Scale Neighborhood Search
Many optimization problems that model the essential issues of important real-world decision making are computationally… Expand
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… Expand
  • 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 to minimize the total weighted cost of… Expand
  • 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… Expand
Is this relevant?
2004
2004
Very large-scale neighborhood search : Theory , algorithms and applications
A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
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 assignment problem (MRGAP). MRGAP is a generalization of… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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