default search action
Roberto Wolfler Calvo
R. Calvo Wolfler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
- [j58]Juan José Torres Figueroa, Giacomo Nannicini, Emiliano Traversi, Roberto Wolfler Calvo:
A trust-region framework for derivative-free mixed-integer optimization. Math. Program. Comput. 16(3): 369-422 (2024) - 2023
- [j57]Patrick Chervet, Roland Grappe
, Mathieu Lacroix
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50: 100810 (2023) - 2022
- [j56]Michele Barbato
The Schrijver system of the flow cone in series-parallel graphs. Discret. Appl. Math. 308: 162-167 (2022) - [j55]Roberto Baldacci
Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim. Lett. 16(9): 2711-2727 (2022) - 2021
- [j54]Diego Delle Donne
A branch-and-price algorithm for the Minimum Sum Coloring Problem. Discret. Appl. Math. 303: 39-56 (2021) - [j53]Marco Casazza
A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem. Eur. J. Oper. Res. 289(3): 897-911 (2021) - [j52]Timo Gschwind
A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput. 33(3): 1070-1090 (2021) - [j51]Giacomo Nannicini, Emiliano Traversi
A Benders squared (B2) framework for infinite-horizon stochastic linear programs. Math. Program. Comput. 13(4): 645-681 (2021) - [j50]Massimo Di Francesco
Preface: Special issue on freight transportation and logistics. Networks 78(1): 3-4 (2021) - [j49]Mathieu Lacroix
Efficient formulations for the traveling car renter problem and its quota variant. Optim. Lett. 15(6): 1905-1930 (2021) - [j48]Antonio Frangioni, Stefania Pan, Emiliano Traversi
A constraints-aware Reweighted Feasibility Pump approach. Oper. Res. Lett. 49(5): 671-675 (2021) - 2020
- [j47]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi
An exact algorithm for robust influence maximization. Math. Program. 183(1): 419-453 (2020) - [j46]Jean André, Eric Bourreau, Roberto Wolfler Calvo
Introduction to the Special Section: ROADEF/EURO Challenge 2016 - Inventory Routing Problem. Transp. Sci. 54(2): 299-301 (2020) - [j45]Roberto Baldacci
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. Transp. Sci. 54(2): 434-452 (2020) - 2019
- [j44]Stefania Pan, Roberto Wolfler Calvo, Mahuna Akplogan, Lucas Létocart, Nora Touati Moungla:
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. Discret. Optim. 33: 146-168 (2019) - 2018
- [j43]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
Shared mobility systems: an updated survey. Ann. Oper. Res. 271(1): 105-126 (2018) - [j42]Marco Casazza
A branch and price approach for the Split Pickup and Split Delivery VRP. Electron. Notes Discret. Math. 69: 189-196 (2018) - [j41]Stefania Pan, Mahuna Akplogan, Nora Touati Moungla, Lucas Létocart, Roberto Wolfler Calvo, Louis-Martin Rousseau:
A hybrid heuristic for the multi-activity tour scheduling problem. Electron. Notes Discret. Math. 69: 333-340 (2018) - [j40]Marcos de Melo da Silva
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. Eur. J. Oper. Res. 271(1): 40-56 (2018) - [j39]Roberto Wolfler Calvo
Preface: Emerging challenges in transportation planning. Networks 72(3): 309-310 (2018) - [j38]Marco Casazza
The multiple vehicle balancing problem. Networks 72(3): 337-357 (2018) - 2017
- [j37]Roberto Baldacci
The Vehicle Routing Problem with Transhipment Facilities. Transp. Sci. 51(2): 592-606 (2017) - 2016
- [j36]Franck Butelle, Laurent Alfandari, Camille Coti
Fast machine reassignment. Ann. Oper. Res. 242(1): 133-160 (2016) - [j35]Michele Barbato
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21: 25-41 (2016) - [j34]Paolo Gianessi
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. Electron. Notes Discret. Math. 55: 93-96 (2016) - [j33]Paolo Gianessi
The Multicommodity-Ring Location Routing Problem. Transp. Sci. 50(2): 541-558 (2016) - 2015
- [j32]Gilbert Laporte, Frédéric Meunier, Roberto Wolfler Calvo
Shared mobility systems. 4OR 13(4): 341-360 (2015) - [j31]Günes Erdogan
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems. Eur. J. Oper. Res. 245(3): 667-679 (2015) - 2014
- [j30]Günes Erdogan
The static bicycle relocation problem with demand intervals. Eur. J. Oper. Res. 238(2): 451-457 (2014) - [j29]Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. ACM J. Exp. Algorithmics 19(1) (2014) - 2013
- [j28]Daniel Chemla, Frédéric Meunier, Roberto Wolfler Calvo
Bike sharing systems: Solving the static rebalancing problem. Discret. Optim. 10(2): 120-146 (2013) - [j27]Marie-José Huguet, Dominik Kirchler, Pierre Parent, Roberto Wolfler Calvo
Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem. Electron. Notes Discret. Math. 41: 431-437 (2013) - [j26]Hanane Allaoua, Sylvie Borne, Lucas Létocart, Roberto Wolfler Calvo
A matheuristic approach for solving a home health care problem. Electron. Notes Discret. Math. 41: 471-478 (2013) - [j25]Lorenzo Mussone, Roberto Wolfler Calvo
An analytical approach to calculate the capacity of a railway system. Eur. J. Oper. Res. 228(1): 11-23 (2013) - [j24]Roberto Baldacci
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Oper. Res. 61(2): 298-314 (2013) - [j23]Antoine Rozenknop, Roberto Wolfler Calvo
Solving the electricity production planning problem by a column generation based heuristic. J. Sched. 16(6): 585-604 (2013) - [j22]Sandra Ulrich Ngueveu
New Lower Bounds and Exact Method for the m-PVRP. Transp. Sci. 47(1): 38-52 (2013) - 2012
- [j21]Nacima Labadi, Renata Mansini
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. Eur. J. Oper. Res. 220(1): 15-27 (2012) - 2011
- [j20]José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
A Branch-and-Cut method for the Capacitated Location-Routing Problem. Comput. Oper. Res. 38(6): 931-941 (2011) - [j19]Nacima Labadi, Jan Melechovský, Roberto Wolfler Calvo
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heuristics 17(6): 729-753 (2011) - [j18]Roberto Baldacci
An Exact Method for the Capacitated Location-Routing Problem. Oper. Res. 59(5): 1284-1296 (2011) - 2010
- [j17]Sandra Ulrich Ngueveu
Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR 8(4): 387-406 (2010) - [j16]Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo:
Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. 5(1): 13-20 (2010) - [j15]Christian Prins
Metaheuristics for logistics and vehicle routing. Comput. Oper. Res. 37(11): 1833-1834 (2010) - [j14]Sandra Ulrich Ngueveu
An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11): 1877-1885 (2010) - 2008
- [j13]Abdellah El-Fallahi, Christian Prins, Roberto Wolfler Calvo
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 35(5): 1725-1741 (2008) - 2007
- [j12]Roberto Wolfler Calvo
An effective and fast heuristic for the Dial-a-Ride problem. 4OR 5(1): 61-73 (2007) - [j11]Christian Prins, Caroline Prodhon, Angel B. Ruiz
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Transp. Sci. 41(4): 470-483 (2007) - 2006
- [j10]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3): 221-238 (2006) - [j9]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. Ann. Oper. Res. 147(1): 23-41 (2006) - 2005
- [j8]Jan Melechovský, Christian Prins, Roberto Wolfler Calvo
A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs. J. Heuristics 11(5-6): 375-391 (2005) - 2004
- [j7]Roberto Wolfler Calvo
A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13): 2263-2278 (2004) - 2003
- [j6]Roberto Wolfler Calvo
A heuristic approach to the overnight security service problem. Comput. Oper. Res. 30(9): 1269-1287 (2003) - 2002
- [j5]Christian Brand
STEEDS: A strategic transport-energy-environment decision support. Eur. J. Oper. Res. 139(2): 416-435 (2002) - 2001
- [j4]Roberto Cordone, Roberto Wolfler Calvo:
A Heuristic for the Vehicle Routing Problem with Time Windows. J. Heuristics 7(2): 107-129 (2001) - [j3]Roberto Cordone, Fabrizio Ferrandi
An efficient heuristic approach to solve the unate covering problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(12): 1377-1388 (2001) - 2000
- [j2]Roberto Wolfler Calvo
A New Heuristic for the Traveling Salesman Problem with Time Windows. Transp. Sci. 34(1): 113-124 (2000) - 1997
- [j1]Fabio Alberto Schreiber, R. Calvo Wolfler:
Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree. CVGIP Graph. Model. Image Process. 59(2): 61-72 (1997)
Conference and Workshop Papers
- 2023
- [c13]Louis Zigrand
Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems. IJCAI 2023: 6335-6342 - 2021
- [c12]Louis Zigrand
Machine Learning Guided Optimization for Demand Responsive Transport Systems. ECML/PKDD (4) 2021: 420-436 - 2019
- [c11]Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi, Roberto Wolfler Calvo:
An Exact Algorithm for Robust Influence Maximization. IPCO 2019: 313-326 - 2016
- [c10]Caio Corro, Joseph Le Roux, Mathieu Lacroix
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound. ACL (1) 2016 - [c9]Michele Barbato
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. ISCO 2016: 260-272 - 2012
- [c8]Dominik Kirchler, Leo Liberti
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. SEA 2012: 236-247 - 2011
- [c7]Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo:
UniALT for regular language contrained shortest paths on a multi-modal transportation network. ATMOS 2011: 64-75 - [c6]Roberto Wolfler Calvo
A Matheuristic for the Dial-a-Ride Problem. INOC 2011: 450-463 - 2010
- [c5]Nacima Labadi, Jan Melechovský, Roberto Wolfler Calvo
An Effective Hybrid Evolutionary Local Search for Orienteering and Team Orienteering Problems with Time Windows. PPSN (2) 2010: 219-228 - 2009
- [c4]Sandra Ulrich Ngueveu
An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem. EvoWorkshops 2009: 778-787 - [c3]Sophie Toulouse, Roberto Wolfler Calvo
On the Complexity of the Multiple Stack TSP, kSTSP. TAMC 2009: 360-369 - 2006
- [c2]Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. EvoCOP 2006: 183-194 - 2000
- [c1]Roberto Cordone, Fabrizio Ferrandi
An Efficient Heuristic Approach to Solve the Unate Covering Problem. DATE 2000: 364-371
Parts in Books or Collections
- 2010
- [p1]Sandra Ulrich Ngueveu
A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem. Matheuristics 2010: 253-266
Informal and Other Publications
- 2010
- [i1]Sophie Toulouse, Roberto Wolfler Calvo:
On the complexity of the multiple stack TSP, kSTSP. CoRR abs/1009.5029 (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 22:07 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: