Branch and bound vs outer approximation in continuous location problems

• Autores: Rafael Blanquero Bravo , Emilio Carrizosa Priego
• Localización: XXXI Congreso Nacional de Estadística e Investigación Operativa ; V Jornadas de Estadística Pública: Murcia, 10-13 de febrero de 2009 : Libro de Actas, 2009, ISBN 978-84-691-8159-1
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In most continuous location models found in the literature, the objective function is DC (i.e. it can be written as the di erence of two convex functions). This fact has been successfully exploited in recent papers in order to obtain bounds in the branch and bound method called BTST (Big Triangle Small Triangle), proposed by Drezner and Suzuki in 2004. Under a di erent point of view, the DC structure of the objective function can also be used for obtaining deep cuts in an outer approximation algorithm. In this work both approaches are analyzed and compared.