Abstract
In the previous chapter we defined the DOMP and proposed a nonlinear mixed-integer programme to model it. This formulation, (DOMP), has a quadratic objective function as well as a quadratic group of constraints. In this chapter we propose equivalent mixed-integer linear programmes to handle (DOMP), see Nickel [56] and Boland et al. [6]. In other words, we look for linear reformulations (linearisations) of (DOMP) which provide the same feasible solutions and the same optimal objective function value as the original programme. In this chapter we propose three linearisations that are motivated on linearisations developed for the Quadratic Assignment Problem, see Burkard [7] and Rendi [62]. In addition, we show how properties of optimal solutions can be used to strengthen these models, and discuss relationships between them. Furthermore, computational results and an exhaustive statistical study are presented in order to compare the different linearisations.
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
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Domínguez-Marín, P. (2003). Several Linearisations of the Quadratic Formulation (DOMP). In: The Discrete Ordered Median Problem. Combinatorial Optimization, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8511-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8511-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4634-0
Online ISBN: 978-1-4419-8511-8
eBook Packages: Springer Book Archive