default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudio Contardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]François Lamothe
, Claudio Contardo, Matthieu Gruson:
Tilted inequalities and facets of the set covering polytope: A theoretical analysis. Discret. Appl. Math. 357: 143-160 (2024)- [c1]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 - 2023
- [j24]Claudio Contardo, Andrea Lodi, Andrea Tramontani:
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities. INFORMS J. Comput. 35(1): 2-4 (2023) - 2022
- [j23]Diego Rocha Lima, Daniel Aloise, Dario J. Aloise, Claudio Contardo:
Visual attractiveness in vehicle routing via bi-objective optimization. Comput. Oper. Res. 137: 105507 (2022) - [j22]Claudio Contardo, Jorge A. Sefair:
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games. INFORMS J. Comput. 34(2): 890-908 (2022) - [j21]Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony:
Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. INFORMS J. Comput. 34(2): 1141-1156 (2022) - [j20]Naveed Haghani, Claudio Contardo, Julian Yarkony:
Smooth and Flexible Dual Optimal Inequalities. INFORMS J. Optim. 4(1): 29-44 (2022) - [j19]Claudio Contardo, Luciano Costa:
On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization. Int. Trans. Oper. Res. 29(6): 3294-3315 (2022) - 2021
- [j18]Claudio Contardo, Alain Hertz:
An exact algorithm for a class of geometric set-cover problems. Discret. Appl. Math. 300: 25-35 (2021) - [j17]Luciano Costa, Claudio Contardo, Guy Desaulniers, Diego Pecin:
Selective arc-ng pricing for vehicle routing. Int. Trans. Oper. Res. 28(5): 2633-2690 (2021) - [j16]Marilène Cherkesly, Claudio Contardo:
The conditional p-dispersion problem. J. Glob. Optim. 81(1): 23-83 (2021) - [i5]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Amelia Regan, Julian Yarkony:
Multi-Robot Routing with Time Windows: A Column Generation Approach. CoRR abs/2103.08835 (2021) - [i4]Claudio Contardo, Luciano Costa:
On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization. CoRR abs/2108.04233 (2021) - [i3]João Vilela, Bruno Fanzeres, Rafael Martinelli, Claudio Contardo:
Efficient labeling algorithms for adjacent quadratic shortest paths. CoRR abs/2112.04045 (2021) - 2020
- [j15]Claudio Contardo:
Decremental Clustering for the Solution of p-Dispersion Problems to Proven Optimality. INFORMS J. Optim. 2(2): 134-144 (2020) - [i2]Naveed Haghani, Claudio Contardo, Julian Yarkony:
Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing. CoRR abs/2004.05499 (2020) - [i1]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Julian Yarkony:
Integer Programming for Multi-Robot Planning: A Column Generation Approach. CoRR abs/2006.04856 (2020)
2010 – 2019
- 2019
- [j14]Claudio Contardo, Manuel Iori, Raphael Kramer:
A scalable exact algorithm for the vertex p-center problem. Comput. Oper. Res. 103: 211-220 (2019) - [j13]Guy Desaulniers, Diego Pecin, Claudio Contardo:
Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO J. Transp. Logist. 8(2): 147-168 (2019) - [j12]Luciano Costa, Claudio Contardo, Guy Desaulniers:
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. Transp. Sci. 53(4): 946-985 (2019) - 2018
- [j11]Daniel Aloise, Claudio Contardo:
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. J. Glob. Optim. 71(3): 613-630 (2018) - 2017
- [j10]Furkan Enderer, Claudio Contardo, Iván A. Contreras:
Integrating dock-door assignment and vehicle routing with cross-docking. Comput. Oper. Res. 88: 30-43 (2017) - [j9]Diego Pecin, Claudio Contardo, Guy Desaulniers, Eduardo Uchoa:
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 29(3): 489-502 (2017) - 2015
- [j8]Rafael Martinelli, Claudio Contardo:
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. INFORMS J. Comput. 27(4): 658-676 (2015) - [j7]Claudio Contardo, Guy Desaulniers, François Lessard:
Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65(1): 88-99 (2015) - 2014
- [j6]Claudio Contardo, Rafael Martinelli:
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret. Optim. 12: 129-146 (2014) - [j5]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20(1): 1-38 (2014) - [j4]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J. Comput. 26(1): 88-102 (2014) - 2013
- [j3]Claudio Contardo, Jean-François Cordeau, Bernard Gendron:
A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10(4): 263-295 (2013) - 2012
- [j2]Claudio Contardo, Vera C. Hemmelmayr, Teodor Gabriel Crainic:
Lower and upper bounds for the two-echelon capacitated location-routing problem. Comput. Oper. Res. 39(12): 3185-3199 (2012) - 2010
- [j1]Cristián E. Cortés, Martín Matamala, Claudio Contardo:
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200(3): 711-724 (2010)
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:21 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:
