Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Ventura
Person information
- affiliation: National Research Council, Italy
- affiliation (Phd 2002): Sapienza University of Rome
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j23]Tiziano Bacci
, Sara Mattia, Paolo Ventura:
The realization-independent reallocation heuristic for the stochastic container relocation problem. Soft Comput. 27(7): 4223-4233 (2023)- 2022
- [j22]Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Antonio Tancredi, Paolo Ventura:
Easy Cases of Deadlock Detection in Train Scheduling. Oper. Res. 70(4): 2101-2118 (2022) - [j21]Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura:
Optimal patchings for consecutive ones matrices. Math. Program. Comput. 14(1): 43-84 (2022) - [j20]Anna Livia Croella, Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Paolo Ventura:
Disruption Management in Railway Systems by Safe Place Assignment. Transp. Sci. 56(4): 938-952 (2022) - 2021
- [j19]Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Andrea Onofri, Paolo Ventura:
The Tick Formulation for deadlock detection and avoidance in railways traffic control. J. Rail Transp. Plan. Manag. 17: 100239 (2021) - [j18]Adam N. Letchford, Paolo Ventura:
Strengthened clique-family inequalities for the stable set polytope. Oper. Res. Lett. 49(4): 586-589 (2021) - 2020
- [j17]Tiziano Bacci, Sara Mattia, Paolo Ventura:
A branch-and-cut algorithm for the restricted Block Relocation Problem. Eur. J. Oper. Res. 287(2): 452-459 (2020) - [j16]Maria Fleischer Fauske, Carlo Mannino, Paolo Ventura:
Generalized Periodic Vehicle Routing and Maritime Surveillance. Transp. Sci. 54(1): 164-183 (2020) - 2019
- [j15]Tiziano Bacci, Sara Mattia, Paolo Ventura:
The bounded beam search algorithm for the block relocation problem. Comput. Oper. Res. 103: 252-264 (2019) - [j14]Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura:
Single courier single restaurant meal delivery (without routing). Oper. Res. Lett. 47(6): 537-541 (2019) - 2017
- [j13]Claudio Arbib, Mara Servilio, Paolo Ventura:
An improved integer linear programming formulation for the closest 0-1 string problem. Comput. Oper. Res. 80: 94-100 (2017) - 2016
- [j12]Claudio Arbib, Fabrizio Marinelli, Paolo Ventura:
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int. Trans. Oper. Res. 23(1-2): 47-63 (2016) - 2014
- [j11]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect. J. Comb. Theory B 107: 92-122 (2014) - [j10]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect. J. Comb. Theory B 108: 1-28 (2014) - 2013
- [j9]Anna Galluccio, Claudio Gentile, Paolo Ventura:
22-clique-bond of stable set polyhedra. Discret. Appl. Math. 161(13-14): 1988-2000 (2013) - [j8]Luigi De Giovanni, G. Massi, Ferdinando Pezzella, Marc E. Pfetsch, Giovanni Rinaldi, Paolo Ventura:
A heuristic and an exact method for the gate matrix connection cost minimization problem. Int. Trans. Oper. Res. 20(5): 627-643 (2013) - 2010
- [j7]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with large stability number. Electron. Notes Discret. Math. 36: 1025-1032 (2010) - 2009
- [j6]Anna Galluccio, Claudio Gentile, Paolo Ventura:
Gear Composition of Stable Set Polytopes and G-Perfection. Math. Oper. Res. 34(4): 813-836 (2009) - 2008
- [j5]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
The stable set polytope of quasi-line graphs. Comb. 28(1): 45-67 (2008) - [j4]Anna Galluccio, Claudio Gentile, Paolo Ventura:
Gear composition and the stable set polytope. Oper. Res. Lett. 36(4): 419-423 (2008) - 2006
- [j3]Claudio Gentile, Paolo Ventura, Robert Weismantel:
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets. SIAM J. Discret. Math. 20(4): 913-919 (2006) - 2003
- [j2]Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura:
Primal separation for 0/1 polytopes. Math. Program. 95(3): 475-491 (2003) - [j1]Paolo Ventura, Friedrich Eisenbrand:
A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett. 31(3): 429-434 (2003)
Conference and Workshop Papers
- 2018
- [c7]Tiziano Bacci, Sara Mattia, Paolo Ventura:
A New Lower Bound for the Block Relocation Problem. ICCL 2018: 168-174 - 2016
- [c6]Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura:
Optimum Solution of the Closest String Problem via Rank Distance. ISCO 2016: 297-307 - 2011
- [c5]Anna Galluccio, Claudio Gentile, Paolo Ventura:
The stable set polytope of claw-free graphs with stability number greater than three. OR 2011: 47-52 - 2009
- [c4]Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura:
The k-Gear Composition and the Stable Set Polytope. CTW 2009: 251-254 - 2008
- [c3]Anna Galluccio, Claudio Gentile, Paolo Ventura:
On the Stable Set Polytope of Claw-Free Graphs. COCOA 2008: 339-350 - 2005
- [c2]Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305 - 2002
- [c1]Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura:
0/1 optimization and 0/1 primal separation are equivalent. SODA 2002: 920-926
Informal and Other Publications
- 2022
- [i1]Tiziano Bacci, Sara Mattia, Paolo Ventura:
The Bounded Beam Search algorithm for the Block Relocation Problem. CoRR abs/2206.12303 (2022)
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-06-10 20:28 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:
