Variable neighborhood search approach for the location and design problem

DOI10.1007/978-3-319-44914-2_45MaRDI QIDQ3133246zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tat'yana Valentinovna Levanova, Aleksandr Yur'Evich Gnusarev

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_45

zbMATH Keywords

integer programmingupper boundvariable neighborhood searchdiscrete optimizationlocation problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Comparison of two heuristic algorithms for a location and design problem
• Variable neighborhood search for solving the balanced location problem
• scientific article; zbMATH DE number 6004949
• Variable neighborhood search for location routing
• Variable Neighborhood Search

Cited in

(5)

• Comparison of two heuristic algorithms for a location and design problem
• Special issue on variable neighborhood search methods in business and engineering
• An adaptive variable neighborhood search for solving the multi-objective node placement problem
• Variable neighbourhood search for financial derivative problem
• scientific article; zbMATH DE number 6004949 (Why is no real title available?)

This page was built for publication: Variable neighborhood search approach for the location and design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133246)