Home > Research > Publications & Outputs > An overview of neighbourhood search metaheuristics

Electronic data

View graph of relations

An overview of neighbourhood search metaheuristics

Research output: Working paper

Published

Standard

An overview of neighbourhood search metaheuristics. / Wright, M B.

Lancaster University : The Department of Management Science, 2003. (Management Science Working Paper Series).

Research output: Working paper

Harvard

Wright, MB 2003 'An overview of neighbourhood search metaheuristics' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

Wright, M. B. (2003). An overview of neighbourhood search metaheuristics. (Management Science Working Paper Series). The Department of Management Science.

Vancouver

Wright MB. An overview of neighbourhood search metaheuristics. Lancaster University: The Department of Management Science. 2003. (Management Science Working Paper Series).

Author

Wright, M B. / An overview of neighbourhood search metaheuristics. Lancaster University : The Department of Management Science, 2003. (Management Science Working Paper Series).

Bibtex

@techreport{4e16526a8e394e9ca7e4ad912445f214,
title = "An overview of neighbourhood search metaheuristics",
abstract = "This paper gives details of the steps needed to undertake neighbourhood search for a combinatorial optimization problem. The main variations are briefly described and pointers for future research briefly discussed. Throughout there is extensive referencing to some of the most important publications in the area",
author = "Wright, {M B}",
year = "2003",
language = "English",
series = "Management Science Working Paper Series",
publisher = "The Department of Management Science",
type = "WorkingPaper",
institution = "The Department of Management Science",

}

RIS

TY - UNPB

T1 - An overview of neighbourhood search metaheuristics

AU - Wright, M B

PY - 2003

Y1 - 2003

N2 - This paper gives details of the steps needed to undertake neighbourhood search for a combinatorial optimization problem. The main variations are briefly described and pointers for future research briefly discussed. Throughout there is extensive referencing to some of the most important publications in the area

AB - This paper gives details of the steps needed to undertake neighbourhood search for a combinatorial optimization problem. The main variations are briefly described and pointers for future research briefly discussed. Throughout there is extensive referencing to some of the most important publications in the area

M3 - Working paper

T3 - Management Science Working Paper Series

BT - An overview of neighbourhood search metaheuristics

PB - The Department of Management Science

CY - Lancaster University

ER -