Using the primal-dual interior point algorithm within the branch-price-and-cut method

• Grant number: 12/05486-6
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate
• Start date: July 01, 2012
• End date: September 30, 2012
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Marcos Nereu Arenales
• Grantee: Pedro Augusto Munari Junior
• Supervisor: Jacek Gondzio
• Host Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil
• Institution abroad: University of Edinburgh, Scotland
• Associated to the scholarship: 08/09040-7 - Theoretical and computational issues for the efficient implementation of linear optimization methods, BP.DR

Abstract

Branch-price-and-cut has proven to be a very powerful method for solving integer programming problems. It combines decomposition techniques with the generation of both columns and valid inequalities and relies on strong bounds to guide the search in the branch-and-bound tree. In this project, we investigate how the primal-dual interior point algorithm can be combined with the branch-price-and-cut method. This proposal is related to the last topic to be investigated in this doctoral research and it involves the participation of Prof. Jacek Gondzio, from the University of Edinburgh, which justifies the importance of this international academic visit. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

MUNARI, PEDRO; GONDZIO, JACEK. Using the primal-dual interior point algorithm within the branch-price-and-cut method. Computers & Operations Research, v. 40, n. 8, p. 2026-2036, AUG 2013. (12/05486-6, 08/09040-7)