The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
From MaRDI portal
Publication:2884505
DOI10.1287/ijoc.13.3.181.12629zbMath1238.90031WikidataQ113076598 ScholiaQ113076598MaRDI QIDQ2884505
Mark Lewis, Jeffrey L. Kennington
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.13.3.181.12629
90C60: Abstract computational complexity for mathematical programming problems
90B18: Communication networks in operations research
Related Items
On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem, Survivable network design with shared-protection routing, Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
Uses Software