Ricardo Fukasawa

Assistant Professor
Department of Combinatorics and Optimization
Faculty of Mathematics, University of Waterloo

E-mail: rfukasaw at math dot uwaterloo dot ca

Background:

I am currently an assistant professor at the Department of Combinatorics and Optimization of the University of Waterloo. I spent one year (August 2008-July 2009) as a Goldstine Postdoctoral Fellow at IBM Research. I completed my PhD studies in the Algorithms, Combinatorics and Optimization (ACO) program of Georgia Tech and defended my thesis in July 2008, supervised by Prof. Bill Cook. I have an undergraduate and a Master's degree in Electrical Engineering which I obtained from PUC-Rio, under the supervision of Prof. Oscar Porto. Some of my research interests are on cutting planes for general mixed-integer programming, computational mixed-integer programming, operations research and the solution of combinatorial optimization problems, in particular vehicle routing and similar problems.

Teaching:

CO 370: Fall 2009, Winter 2010
CO 227: Fall 2010
CO 759: Advanced Integer Programming: Fall 2010
CO 452/652: Integer Programming: Winter 2011
CO 450/650: Combinatorial Optimization: Fall 2011

Research Interests:

General Areas

Mixed Integer Programming (theory and computation)
Operations Research
Polyhedral Combinatorics
Combinatorial Optimization

Specific Problems/Applications

Railroad Logistics problems
Capacitated Vehicle Routing/Minimum Spanning Tree

Service:

I am the organizer of the Tutte seminar which is a weekly seminar series for the C&O Department.
I am in the organizing committee of the MIP 2011 workshop.
Previous service: Committee of MIP 2010. Session chair/organizer for INFORMS annual meeting.

Publications:

Refereed Journals

R. Fukasawa and M. Goycoolea. On the exact separation of mixed-integer knapsack cuts. To appear in Mathematical Programming. DOI: 10.1007/s10107-009-0284-7
W. Cook, S. Dash, R. Fukasawa and M. Goycoolea. Numerically safe Gomory mixed-integer cuts. To appear in INFORMS Journal on Computing. DOI: 10.1287/ijoc.1090.0324
S. Dash, R. Fukasawa and O. Gunluk. On a generalization of the master cyclic group polyhedron. To appear in Mathematical Programming. DOI: 10.1007/s10107-008-0252-7
E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão and D. Andrade. Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Mathematical Programming, Series A, volume 112, number 2, pp. 443--472, 2008.
R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa and R. F. Werneck. Robust branch-and-cut-and-price for the capacitated vehicle routing problem.. Mathematical Programming Series A, volume 106, number 3, pp. 491--511, 2006.

Submitted papers

S. Dash, R. Fukasawa and O. Gunluk. The master equality polyhedron with multiple rows.
R. Fukasawa and O. Gunluk. Strengthening lattice-free cuts using non-negativity

Conference Proceedings

R. Fukasawa, M. Goycoolea. On the exact separation of mixed-integer knapsack cuts. Proceedings of the twelfth Integer Programming and Combinatorial Optimization conference IPCO'07, Ithaca, NY. Lecture Notes in Computer Science, Vol.4513 pp.225--239, 2007.
S. Dash, R. Fukasawa, O. Gunluk. On a Generalization of the master cyclic group polyhedron. Proceedings of the twelfth Integer Programming and Combinatorial Optimization conference IPCO'07, Ithaca, NY. Lecture Notes in Computer Science, Vol.4513 pp.197--209, 2007.
R. Fukasawa, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa and R.F. Werneck. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Proceedings of the tenth Integer Programming and Combinatorial Optimization conference IPCO'04, New York, Lecture Notes in Computer Science, Vol.3064 pp.1-15, 2004.
R. Fukasawa, M. Poggi de Aragão, O. Porto and E. Uchoa. Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem. Proceedings of the International Network Optmization Conference, pp. 231-236, Evry, France, 2003.
R. Fukasawa, M. Poggi de Aragão, O. Porto and E. Uchoa. Solving the freight car flow problem to optimality. Proceedings of the ATMOS 2002, Málaga, Spain. Electronic Notes in Theoretical Computer Science, Vol.66 (6), pp. 1-14, Elsevier, 2002.

Others:

R. Fukasawa. Single-row Mixed-integer Programs: Theory and Computations. PhD Thesis. ACO-GeorgiaTech, 2008
E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão and D. Andrade. Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation. Technical Report: Logistics/SCM Research Group working paper series, L-2006-08, 2006.
R. Fukasawa, M. Poggi de Aragao, M. Reis, and E. Uchoa. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Technical Report RPEP Vol.3 no.8, Universidade Federal Fluminense, Engenharia de Producao, Niteroi, Brazil, 2003.
R. Fukasawa. Solution of railroad logistics problems using Integer Programming. Masters Dissertation (in Portuguese). Electrical Engineering Department, PUC-Rio, 2002.

Presentations:

"The master equality polyhedron with multiple rows.
MIP 2009 (June 2009)
"Experiments with Extended Capacity Cuts.
INFORMS Annual meeting 2008 (October, 2008)
"Single-row mixed-integer programs: Theory and computations."
Thesis defense - GeorgiaTech (June, 2008)
Lehigh University - Dept. of Ind. and Syst. Eng. (February, 2008)
University of Waterloo - Dept. of Combinatorics and Optimization (February, 2008)
Argonne National Labs (January, 2008)
ISYE DOS Seminar at GeorgiaTech (January, 2008)
"Numerically accurate Gomory mixed-integer cuts."
AUSSOIS 2008 (January, 2008)
INFORMS Annual meeting 2007 (November, 2007)
"On a generalization of the master cyclic group polyhedron."
INFORMS Annual meeting 2007 (November, 2007)
IPCO 2007 (June, 2007)
IP Seminar, GeorgiaTech (Oct, 2006) - (presented with title ``Polyhedral study of the generalized master knapsack problem.'')
IBM student seminar (June, 2006)
"On the capacitated vehicle routing problem."
Invited presentation at Universidad de Chile (April, 2007)
"Robust Branch-and-cut-and-price and Extended Capacity Cuts."
Invited presentation at IBM Research (Dec, 2006)
"MIR inequalities, mixed integer knapsack problems and the closure of single row systems"
INFORMS Annual meeting 2006 (Nov, 2006)
International Symposium on Mathematical Programming, ISMP (Aug, 2006)
IBM IP/AP for Lunch (July, 2006)
"Choosing the best cuts (Poster)"
MIP 2006 (June, 2006)
"Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem."
International Symposium on Mathematical Programming, ISMP (August, 2003)
"Solving the freight car flow problem to optimality."}
Algorithmic Methods and Models for Optimization of Railways, ATMOS (July, 2002)

Collaborators:

Diogo Andrade, David Applegate, Bill Cook, Sanjeeb Dash, Marcos Goycoolea, Oktay Gunluk, Jens Lysgaard, Marcus Poggi de Aragão, Oscar Porto, Marcelo Reis, Eduardo Uchoa, Renato Werneck