Ricardo Fukasawa
Orcid: 0000-0001-8785-5906Affiliations:
- University of Waterloo, Canada
According to our database1,
Ricardo Fukasawa
authored at least 36 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands.
Oper. Res. Lett., January, 2023
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
Integration of Machine Scheduling and Personnel Allocation for an Industrial-Scale Analytical Services Facility.
Proceedings of the 9th International Conference on Control, 2023
2022
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem.
Discret. Optim., 2022
2021
A novel stochastic programming approach for scheduling of batch processes with decision dependent time of uncertainty realization.
Ann. Oper. Res., 2021
2020
Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant.
J. Sched., 2020
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
Math. Program., 2018
2017
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
2013
Math. Program. Comput., 2013
2012
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem.
Networks, 2012
2011
2010
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
2008
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008
2006
Math. Program., 2006
2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2002
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002