default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Barbato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Michele Barbato
, Luís Gouveia:
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms. Eur. J. Oper. Res. 316(2): 473-487 (2024)- [j9]Michele Barbato, Alberto Ceselli:
Mathematical programming for simultaneous feature selection and outlier detection under l1 norm. Eur. J. Oper. Res. 316(3): 1070-1084 (2024) - [j8]Michele Barbato, Alberto Ceselli, Giovanni Righini:
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses. J. Sched. 27(4): 393-407 (2024) - [i2]Michele Barbato, Alberto Ceselli, Rosario Messana:
Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget. CoRR abs/2407.17341 (2024) - 2023
- [j7]Michele Barbato, Alberto Ceselli, Marco Premoli:
On the impact of resource relocation in facing health emergencies. Eur. J. Oper. Res. 308(1): 422-435 (2023) - [j6]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
Box-total dual integrality and edge-connectivity. Math. Program. 197(1): 307-336 (2023) - [j5]Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau:
Node based compact formulations for the Hamiltonian p-median problem. Networks 82(4): 336-370 (2023) - [i1]Michele Barbato, Nicola Bianchessi:
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. CoRR abs/2301.00739 (2023) - 2022
- [j4]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo:
The Schrijver system of the flow cone in series-parallel graphs. Discret. Appl. Math. 308: 162-167 (2022) - 2021
- [j3]Michele Barbato, Dario Bezzi:
Monopolar graphs: Complexity of computing classical graph parameters. Discret. Appl. Math. 291: 277-285 (2021) - 2020
- [c2]Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. ISCO 2020: 27-41
2010 – 2019
- 2018
- [j2]Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira:
Lexicographical polytopes. Discret. Appl. Math. 240: 3-7 (2018) - 2016
- [b1]Michele Barbato:
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques. (A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders). Sorbonne Paris Cité, France, 2016 - [j1]Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21: 25-41 (2016) - [c1]Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. ISCO 2016: 260-272
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-08-29 21:56 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:
