Ricardo Fukasawa

According to our database1, Ricardo Fukasawa authored at least 27 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant.
J. Sched., 2020

Split cuts from sparse disjunctions.
Math. Program. Comput., 2020

2019
The (not so) trivial lifting in two dimensions.
Math. Program. Comput., 2019

Permutations in the Factorization of Simplex Bases.
INFORMS J. Comput., 2019

Bi-objective short-term scheduling in a rolling horizon framework: <i>a priori</i> approaches with alternative operational objectives.
Comput. Oper. Res., 2019

2018
Intersection cuts for single row corner relaxations.
Math. Program. Comput., 2018

Exact algorithms for the chance-constrained vehicle routing problem.
Math. Program., 2018

Opposite Elements in Clutters.
Math. Oper. Res., 2018

A Joint Vehicle Routing and Speed Optimization Problem.
INFORMS J. Comput., 2018

2017
Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem.
INFORMS J. Comput., 2017

A multitasking continuous time formulation for short-term scheduling of operations in multipurpose plants.
Comput. Chem. Eng., 2017

2016
A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem.
Transp. Sci., 2016

On the mixing set with a knapsack constraint.
Math. Program., 2016

2013
The time dependent traveling salesman problem: polyhedra and algorithm.
Math. Program. Comput., 2013

2012
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem.
Networks, 2012

The master equality polyhedron with multiple rows.
Math. Program., 2012

2011
On the exact separation of mixed integer knapsack cuts.
Math. Program., 2011

Strengthening lattice-free cuts using non-negativity.
Discret. Optim., 2011

2010
Lifting, tilting and fractional programming revisited.
Oper. Res. Lett., 2010

On a generalization of the master cyclic group polyhedron.
Math. Program., 2010

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Numerically Safe Gomory Mixed-Integer Cuts.
INFORMS J. Comput., 2009

2008
Single-row mixed-integer programs: theory and computations.
PhD thesis, 2008

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008

2006
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Math. Program., 2006

2004
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Solving the Freight Car Flow Problem to Optimality.
Electron. Notes Theor. Comput. Sci., 2002


  Loading...