OPTIMIZATION, DISCRETE MATHEMATICS AND APPLICATIONS (OPTIMA)

This page shows the publications appeared in journals, collections, periodic conferences, and books whose authors are currently affiliated with the Institute. The publications are grouped by research topic and then by publication site. Finally, each publication site is linked to the corresponding article list. The numbers in square brackets give the total number of publications associated with the corresponding item.

Computational Optimization and Applications
  • Sara Mattia, Poss M.: A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Computational Optimization and Applications 69, 753-800, 2018
  • Frangioni A., Furini F., Claudio Gentile: Approximated Perspective Relaxations: a Project&Lift Approach, Computational Optimization and Applications 63, 705-735, 2016
  • van Ackoij W., Frangioni A., de Oliveira W.: Inexact Stabilized Benders' Decomposition Approaches, with Application to Chance-Constrained Problems with Finite Support, Computational Optimization and Applications 65, 637-669, 2016
  • Sara Mattia: The Robust Network Loading Problem with Dynamic Routing, Computational Optimization and Applications 54(3), 619-643, 2013
  • Liuzzi G., Lucidi S., Rinaldi F.: Derivative-free methods for bound constrained mixed-integer optimization, Computational Optimization and Applications 53, 505-526, 2012
  • Sara Mattia: Solving Survivable Two-Layer Network Design Problems by Metric Inequalities, Computational Optimization and Applications 51(2), 809-834, 2012
  • Mannino C., Sara Mattia, Sassano A.: Planning Wireless Networks by Shortest Path, Computational Optimization and Applications 48(3), 533-551, 2011
  • Frangioni A., Claudio Gentile: Prim-based support-graph preconditioners for Min-Cost Flow Problems, Computational Optimization and Applications 36 (2--3), 271-287, 2007
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -