Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design

Autor:	Meinolf Sellmann, Georg Kliewer, Achim Koberstein
Rok vydání:	2002
Předmět:	Network planning and design Mathematical optimization Variable (computer science) symbols.namesake Cardinality Lagrangian relaxation Knapsack problem Cardinal number Node (networking) symbols Focus (optics) Mathematics
Zdroj:	Algorithms — ESA 2002 ISBN: 9783540441809 ESA
DOI:	10.1007/3-540-45749-6_73
Popis:	We present a branch-and-bound approach for the Capacitated Network Design Problem. We focus on tightening strategies such as variable fixing and local cuts that can be applied in every search node. Different variable fixing algorithms based on Lagrangian relaxations are evaluated solitarily and in combined versions. Moreover, we develop cardinality cuts for the problem and evaluate their usefulness empirically by numerous tests.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::10411a6b337f0210f28bf5b4db958a96 https://doi.org/10.1007/3-540-45749-6_73 Zobrazit plný text záznamu