Single-row mixed-integer programs: Theory and computations (2008)
Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row...
Single-row mixed-integer programs: Theory and computations (2008)
Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row...
Single-row mixed-integer programs: theory and computations (2008)
Single-row mixed-integer programming (MIP) problems have been studied thoroughly under many different perspectives over the years. While not many practical applications can be modeled as a single-row...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diego
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation...
Departamento de Engenharia Eletrica, Pontifcia Universidade Catolica do Rio (2007)
Ricardo Fukasawa, Marcus Vinicius, Eduardo Uchoa
A pervasive problem in freight railroad operations is to determine a feasible ow of cars to meet the required demands within a certain period of time. In this work we present a method to determine an...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diogo
nullThis paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a...
Robust branch-and-cut-and-price for the capacitated vehicle routing problem (2003)
Ricardo Fukasawa, Marcelo Reis, Eduardo Uchoa, Ricardo Fukasawa, ...
During the eigthies and early nineties, the best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) utilized lower bounds obtained by Lagrangean relaxation or column generation....
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2003)
Ricardo Fukasawa, Jens Lysgaard, Marcelo Reis, Marcus Poggi, Aragão Marcelo Reis, ...
The best exact algorithms for the capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that...
Robust branch-and-cut-and-price for the capacitated vehicle routing problem (2003)
Ricardo Fukasawa, Jens Lysgaard, Marcelo Reis, Eduardo Uchoa, Renato F. Werneck
Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an...
SOLUTION OF RAILROAD LOGISTICS PROBLEMS USING INTEGER PROGRAMMING (2002)
Railroad systems are major candidates for the use of optimization techniques to obtain a more efficient use of resources. In this research we present two integerprogramming models for freight...
SOLUTION OF RAILROAD LOGISTICS PROBLEMS USING INTEGER PROGRAMMING (2002)
Railroad systems are major candidates for the use of optimization techniques to obtain a more efficient use of resources. In this research we present two integerprogramming models for freight...
SOLUTION OF RAILROAD LOGISTICS PROBLEMS USING INTEGER PROGRAMMING (2002)
Railroad systems are major candidates for the use of optimization techniques to obtain a more efficient use of resources. In this research we present two integerprogramming models for freight...
Uchoa, Eduardo, Fukasawa, Ricardo, Lysgaard, Jens, Pessoa, Artur, Poggi De Aragão, Marcus, Andrade, Diogo
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation...