Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,055,298 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
(opens in a new tab)
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.
2011
2011
“It Can Start From Anything”: An Existential Phenomenological Investigation of Athletes’ Experiences of Psychological Momentum
G. Young
2011
Corpus ID: 140898571
Psychological Momentum (PM) is a commonly recognized phenomenon in sport, yet remains one of the least understood (Taylor…
Expand
2008
2008
Estimating phylogenies under maximum likelihood : A very large-scale neighborhood approach
D. Catanzaro
,
R. Pesenti
,
M. Milinkovitch
2008
Corpus ID: 16095536
A basic problem in evolutionary genetics is the estimation of phylogenies among DNA or protein sequences. This problem is known…
Expand
2007
2007
Very Large-Scale Neighborhood Search: Theory, Algorithms, and Applications
T. Gonzalez
2007
Corpus ID: 198319905
2005
2005
A Multi-Exchange Heuristic to Production Line Design under Free Trade Agreement
Yunsong Guo
,
Yanzhi Li
,
A. Lim
,
B. Rodrigues
2005
Corpus ID: 906075
Production line design(PLD) can be viewed as a facility location problem in global supply chain. However, New cost factors such…
Expand
2004
2004
OPTIMIZATION MODELS FOR SOURCING DECISIONS IN SUPPLY CHAIN MANAGEMENT
Wei Huang
2004
Corpus ID: 167353013
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the…
Expand
Review
2002
Review
2002
Very Large-Scale Neighborhood Search in Airline Fleet Scheduling
R. Ahuja
,
J. Orlin
2002
Corpus ID: 5975845
Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical…
Expand
2002
2002
Polynomial Time Algorithm and Its Heuristics to Find the Best Move of a Very Large-Scale Neighborhood Search Technique
D. Huynh
Joint Conference on Information Sciences
2002
Corpus ID: 45410155
2002
2002
Chapter 13 SOLVING MULTI-CRITERIA THROUGH-FLEET ASSIGNMENT MODELS
R. Ahuja
,
Jian Liu
,
A. Mukherjee
,
J. Orlin
,
D. Sharma
2002
Corpus ID: 18053368
The airline industry has been a pioneer in using operations research techniques to solve complex business problems related to the…
Expand