6.5 Conclusion
In this chapter, we studied the concentrator location problems with quadratic capacity constraints. We first considered the polytope defined by a quadratic knapsack inequality. We modified the definition of a cover for the quadratic case. We presented two branch and bound algorithms, one to solve the separation problem and the other one to compute the lifting coefficients for quadratic cover inequalities.
With this new definition of a cover, most of the results for the linear capacitated case remained valid for the quadratic case. This chapter gave a list of these results without proofs.
The summary of polyhedral results presented in Chapters 4, 5 and 6 is provided next.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2005). Problems with Quadratic Capacity Constraints. In: Concentrator Location in Telecommunications Networks. Combinatorial Optimization, vol 16. Springer, Boston, MA. https://doi.org/10.1007/0-387-23532-9_6
Download citation
DOI: https://doi.org/10.1007/0-387-23532-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23531-8
Online ISBN: 978-0-387-23532-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)