This page shows all publications that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.
You can browse through them using either the links of the following line or those associated with
author names.
Show all publications of the year
ALL, with author Ventura P., in the category ALL
(or show them all): (Items found: 55)
2022 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001
2022 [top]
- Tiziano Bacci, Sara Mattia, Paolo Ventura: The realization-independent reallocation heuristic for the stochastic container relocation problem, Soft Computing in press, DOI 10.1007/s00500-022-07070-3, 2022
- Pfetsch M.E., Giovanni Rinaldi, Paolo Ventura: Optimal patchings for consecutive ones matrices, Mathematical Programming Computation 14, 43-84, 2022
2020 [top]
- Tiziano Bacci, Sara Mattia, Paolo Ventura: A Branch and Cut algorithm for the Restricted Block Relocation Problem, European Journal of Operational Research 287, 452-459, 2020
- Fleischer Fauske Maria, Mannino C., Paolo Ventura: Generalized Periodic Vehicle Routing and Maritime Surveillance, Transportation Science 54, 164-183, 2020
2019 [top]
- Tiziano Bacci, Conte S., Matera D., Sara Mattia, Paolo Ventura: A New Software System for Optimizing the Operations at a Container Terminal, In: Dell'Amico M., Gaudioso M., Stecca G. (eds) A View of Operations Research Applications in Italy, 2018. AIRO Springer Series, vol 2, pp.41--50. Springer, Cham. DOI: 10.1007/978-3-030-25842-9_4, 2019
- Tiziano Bacci, Sara Mattia, Paolo Ventura: The Bounded Beam Search algorithm for the Block Relocation Problem, Computers & Operations Research 103, 252-264, 2019
- Bacci T., Sara Mattia, Paolo Ventura: AN IP-BASED EXACT ALGORITHM FOR THE RESTRICTED BLOCK RELOCATION PROBLEM, IASI-CNR, R. 19-02, 2019
- Cosmi Matteo, Oriolo G., Piccialli V., Paolo Ventura: Single courier single restaurant meal delivery (without routing), Operations Research Letters 47, 537-541, 2019
2018 [top]
- Tiziano Bacci, Conte S., Matera D., Sara Mattia, Paolo Ventura: OPTIMIZING OPERATIONS IN CONTAINER YARDS, IASI-CNR, R. 18-13, 2018
- Tiziano Bacci, Sara Mattia, Paolo Ventura: A new heuristic algorithm for the restricted Block Relocation Problem, IASI-CNR, R. 18-01, 9/2018
- Tiziano Bacci, Sara Mattia, Paolo Ventura: A new algorithm for computing a lower bound for the restricted Block Relocation Problem, IASI-CNR, R. 18-02, 9/2018
- Tiziano Bacci, Sara Mattia, Paolo Ventura: A new lower bound for the Block Relocation Problem, in the Proceedings of ICCL 2018, Lecture Notes in Computer Science, 11184, pp. 168–174, 2018
- Pfetsch M.E., Giovanni Rinaldi, Paolo Ventura: Optimal patchings for consecutive ones matrices, IASI-CNR, R. 18-10, 11/2018
2017 [top]
- Arbib C., Servilio M, Paolo Ventura: An improved integer linear pro- gramming formulation for the closest 0-1 string problem, Computers & Operations Research 80, 2017
- Tiziano Bacci, Sara Mattia, Paolo Ventura: Some Complexity Results for the Minimum Blocking Items Problem, in the Proceedings of ODS 2017, Springer Proceedings in Mathematics & Statistics, 217, pp. 475-483, 2017
- Bacci T., Sara Mattia, Paolo Ventura: ON THE COMPLEXITY OF THE MINIMUM BLOCKING ITEM PROBLEM, IASI-CNR, R. 17-06, 2017
2016 [top]
- Arbib C., Giovanni Felici, Servilio M, Paolo Ventura: Optimum Solution of the Closest String Problem via Rank Distance, Lecture Notes in Computer Science 9849, 297-307, 2016
- Arbib C., Marinelli F., Paolo Ventura: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, International Transactions in Operational Research 23, 47-63, 2016
2015 [top]
2014 [top]
- Arbib C., Marinelli F., Paolo Ventura: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, International Transactions in Operational Research 11, 47-63, 2014
- 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, Journal of Combinatorial Theory Series B 108, 1-28, 2014
- 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, Journal of Combinatorial Theory Series B 107, 92-122, 2014
2013 [top]
- De Giovanni L., Massi G., Pezzella F., Pfetsch M.E., Giovanni Rinaldi, Paolo Ventura: A heuristic and an exact method for the gate matrix connection cost minimization problem, International Transactions in Operational Research 20, 627-643, 2013
- Anna Galluccio, Claudio Gentile, Paolo Ventura: 2-clique-bond of stable set polyhedra, Discrete Applied Mathematics 161, 1988-2000, 2013
2012 [top]
- Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with stability number greater than three, in: Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Schmedders K., Luethi H.-J., Klatte D. eds., Operations Research Proceedings, Springer Heidelberg Germania, 47-52, 2012
2011 [top]
- Faenza Y, Oriolo G., Stauffer G., Paolo Ventura: Stable Sets in Claw- Free Graphs: A Journey Through Algorithms and Polytopes, In "In Progress
in Combinatorial Optimization", R. Majoub ed., Wiley (2011)., 2011
- Oriolo G., Stauffer G., Paolo Ventura: Stable set in claw-free graphs: re- cent achievement and future challenges, Operations Research 86, 1-8, 2011
2010 [top]
- 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, IASI-CNR, R. 10-06, 7/2010
- 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, IASI-CNR, R. 10-07, 7/2010
- Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs with large stability number, Electronic Notes in Discrete Mathematics, ISCO 2010 International Symposium on Combinatorial Optimization, 2010
2009 [top]
- Anna Galluccio, Claudio Gentile, Paolo Ventura: Gear Composition of stable set polytopes and G-perfection, Mathematics of Operations Research 34, 813-836, 2009
- Anna Galluccio, Claudio Gentile, Paolo Ventura: The k-gear composition and the stable set polytope, in the Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, June 2-4, Liberti L., Cafieri S., Mucherino A., Nannicini G., Tarissan F. eds., 2009
- Anna Galluccio, Claudio Gentile, Paolo Ventura: 2-clique-bond of stable set polyhedra, IASI-CNR, R. 09-10, 2009
- Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs I: XX-strip composition versus gear composition, IASI-CNR, R. 09-05, 2009
- Anna Galluccio, Claudio Gentile, Paolo Ventura: The stable set polytope of claw-free graphs II: XX-graphs are G-perfect, IASI-CNR, R. 09-08, 2009
2008 [top]
- Eisenbrand F., Oriolo G., Stauffer G., Paolo Ventura: The stable set polytope of quasi-line graphs, Combinatorica 28 (1), 45-67, 2008
- Anna Galluccio, Claudio Gentile, Paolo Ventura: Gear composition and the Stable Set Polytope, Operations Research Letters 36, 419-423, 2008
- Anna Galluccio, Claudio Gentile, Paolo Ventura: On the stable set polytope of claw-free graphs, in: COCOA 2008, Lecture Notes in Computer Science, 5165, 339-350, 2008
2007 [top]
- Anna Galluccio, Claudio Gentile, Paolo Ventura: G-perfect graphs, manuscpript, 2007
- Anna Galluccio, Claudio Gentile, Paolo Ventura: Gear composition of stable set polytopes and G-perfection, IASI-CNR, R. 661, 5/2007
- Anna Galluccio, Claudio Gentile, Paolo Ventura: Towards a linear description of the Stable Set polytope for claw-free graphs, manuscript submitted to IPCO 2008, 2007
- Anna Galluccio, Claudio Gentile, Paolo Ventura: On the stable set polytope of claw-free graphs, IASI-CNR, R. 663, 6/2007
- Claudio Gentile, Neto J., Giovanni Rinaldi, Paolo Ventura: On a graph transformation for the stable set problem, IASI-CNR, R. 658, 3/2007
2006 [top]
- Anna Galluccio, Claudio Gentile, Paolo Ventura: New facet defining inequalities for the Stable Set Polytope, IASI-CNR, R. 641, 5/2006
- Claudio Gentile, Paolo Ventura, Weismantel R.: Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets, SIAM Journal on Discrete Mathematics 20 (4), 913-919, 2006
2005 [top]
- Eisenbrand F., Oriolo G., Stauffer G., Paolo Ventura: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs, in: Integer Programming and Combinatorial Optimization - IPCO XI, Lecture Notes in Computer Science, 3509, 291-305, 2005
- Paolo Ventura: The Stable Set Polytope of Quasi-Line Graphs: A Proof of Ben Rebea's Conjecture. Part 2, AIRO 2005, Camerino, 6-9 Settembre, 2005
- Paolo Ventura: Mod-2 cuts generation yelds the convex hull of bounded integer feasible sets, 9th Combinatorial Optimization Workshop, Aussois, 3-15 Marzo, 2005
2004 [top]
2003 [top]
2002 [top]
- Eisenbrand F., Giovanni Rinaldi, Paolo Ventura: 0/1 Optimization and 0/1 Primal Separation are Equivalent, in the Proceedings of Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 920-926, 2002
- Eisenbrand F., Paolo Ventura: A compact linear program for testing optimality of perfect matchings, IASI-CNR, R. 573, 2002
- Paolo Ventura: Some contributions to primal and dual separation for integer programming, Ph.D. Thesis in Operation Research, University "La Sapienza" of Rome. Advisor: Dr. Giovanni Rinaldi, 2002
2001 [top] |
