default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRicardo Fukasawa
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Julien Ferry, Ricardo Fukasawa, Timothée Pascal, Thibaut Vidal:
Trained Random Forests Completely Reveal your Dataset. ICML 2024- [c9]Claudio Contardo, Ricardo Fukasawa
, Louis-Martin Rousseau, Thibaut Vidal:
Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming. ISCO 2024: 318-331 - [i2]Julien Ferry, Ricardo Fukasawa, Timothée Pascal, Thibaut Vidal:
Trained Random Forests Completely Reveal your Dataset. CoRR abs/2402.19232 (2024) - [i1]Noah Weninger, Ricardo Fukasawa:
Interdiction of minimum spanning trees and other matroid bases. CoRR abs/2407.14906 (2024) - 2023
- [j27]Ricardo Fukasawa, Joshua Gunter:
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 51(1): 11-16 (2023) - [c8]Daniela Lubke, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Integration of Machine Scheduling and Personnel Allocation for an Industrial-Scale Analytical Services Facility. CoDIT 2023: 1647-1652 - [c7]Noah Weninger, Ricardo Fukasawa:
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints. IPCO 2023: 438-452 - 2022
- [j26]Mauro Henrique Mulati, Ricardo Fukasawa, Flávio Keidi Miyazawa:
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem. Discret. Optim. 45: 100710 (2022) - 2021
- [j25]Kavitha G. Menon, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
A novel stochastic programming approach for scheduling of batch processes with decision dependent time of uncertainty realization. Ann. Oper. Res. 305(1): 163-190 (2021) - [j24]Álinson S. Xavier, Ricardo Fukasawa, Laurent Poirrier:
Multirow Intersection Cuts Based on the Infinity Norm. INFORMS J. Comput. 33(4): 1624-1643 (2021) - 2020
- [j23]Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang:
Split cuts from sparse disjunctions. Math. Program. Comput. 12(2): 295-335 (2020) - [j22]Zachariah Stevenson, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant. J. Sched. 23(3): 397-410 (2020)
2010 – 2019
- 2019
- [j21]Do Yeon Lee, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives. Comput. Oper. Res. 111: 141-154 (2019) - [j20]Ricardo Fukasawa, Laurent Poirrier:
Permutations in the Factorization of Simplex Bases. INFORMS J. Comput. 31(3): 612-632 (2019) - [j19]Ricardo Fukasawa, Laurent Poirrier, Álinson S. Xavier:
The (not so) trivial lifting in two dimensions. Math. Program. Comput. 11(2): 211-235 (2019) - 2018
- [j18]Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song:
A Joint Vehicle Routing and Speed Optimization Problem. INFORMS J. Comput. 30(4): 694-709 (2018) - [j17]Ahmad Abdi, Ricardo Fukasawa, Laura Sanità:
Opposite Elements in Clutters. Math. Oper. Res. 43(2): 428-459 (2018) - [j16]Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact algorithms for the chance-constrained vehicle routing problem. Math. Program. 172(1-2): 105-138 (2018) - [j15]Ricardo Fukasawa, Laurent Poirrier, Álinson S. Xavier:
Intersection cuts for single row corner relaxations. Math. Program. Comput. 10(3): 423-455 (2018) - 2017
- [j14]Saman Lagzi, Ricardo Fukasawa, Luis A. Ricardez-Sandoval:
A multitasking continuous time formulation for short-term scheduling of operations in multipurpose plants. Comput. Chem. Eng. 97: 135-146 (2017) - [j13]Ricardo Fukasawa, Laurent Poirrier:
Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem. INFORMS J. Comput. 29(3): 544-557 (2017) - 2016
- [j12]Ahmad Abdi, Ricardo Fukasawa:
On the mixing set with a knapsack constraint. Math. Program. 157(1): 191-217 (2016) - [j11]Ricardo Fukasawa, Qie He, Yongjia Song:
A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem. Transp. Sci. 50(1): 23-34 (2016) - [c6]Thai Dinh, Ricardo Fukasawa, James R. Luedtke:
Exact Algorithms for the Chance-Constrained Vehicle Routing Problem. IPCO 2016: 89-101 - 2013
- [j10]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5(1): 27-55 (2013) - 2012
- [j9]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
The master equality polyhedron with multiple rows. Math. Program. 132(1-2): 125-151 (2012) - [j8]Eduardo Uchoa, Túlio A. M. Toffolo, Maurício C. de Souza, Alexandre Xavier Martins, Ricardo Fukasawa:
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks 59(1): 148-160 (2012) - 2011
- [j7]Ricardo Fukasawa, Oktay Günlük:
Strengthening lattice-free cuts using non-negativity. Discret. Optim. 8(2): 229-245 (2011) - [j6]Ricardo Fukasawa, Marcos Goycoolea:
On the exact separation of mixed integer knapsack cuts. Math. Program. 128(1-2): 19-41 (2011) - 2010
- [j5]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
On a generalization of the master cyclic group polyhedron. Math. Program. 125(1): 1-30 (2010) - [j4]Daniel G. Espinoza, Ricardo Fukasawa, Marcos Goycoolea:
Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 38(6): 559-563 (2010) - [c5]Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa:
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA 2010: 202-213
2000 – 2009
- 2009
- [j3]William J. Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea:
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21(4): 641-649 (2009) - 2008
- [b1]Ricardo Fukasawa:
Single-row mixed-integer programs: theory and computations. Georgia Institute of Technology, Atlanta, GA, USA, 2008 - [j2]Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade:
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. Math. Program. 112(2): 443-472 (2008) - 2007
- [c4]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209 - [c3]Ricardo Fukasawa, Marcos Goycoolea:
On the Exact Separation of Mixed Integer Knapsack Cuts. IPCO 2007: 225-239 - 2006
- [j1]Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Math. Program. 106(3): 491-511 (2006) - 2004
- [c2]Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck:
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. IPCO 2004: 1-15 - 2002
- [c1]Ricardo Fukasawa, Marcus Poggi de Aragão, Oscar Porto, Eduardo Uchoa:
Solving the Freight Car Flow Problem to Optimality. ATMOS 2002: 42-52
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
