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 (opens in a new tab)

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.
2017
2017
Very Large-Scale Neighborhood Search for the Multidimensional Assignment Problem
The multidimensional assignment problem is an extension of the linear assignment problem to higher dimensions. This NP-hard… 
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… 
2010
2010
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… 
Review
2008
Review
2008
Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
Summary. Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this… 
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 three… 
2005
2005
A very large-scale neighborhood search approach to capacitated warehouse routing problem
Warehouse management is an important issue in supply chain management. Among all warehouse operations, "order-picking" is the… 
2005
2005
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem
The K-Constraint Multiple Knapsack Problem (K-MKP) is a generalization of the multiple knapsack problem, which is one of the… 
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… 
Review
2002
Review
2002
Very Large-Scale Neighborhood Search in Airline Fleet Scheduling
Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical… 
Review
2000
Review
2000
Very Large-Scale Neighborhood Search
Many optimization problems that model the essential issues of important real-world decision making are computationally… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)