Skip to content
  • Project
  • Recruitment
  • Publications
  • Project Team
  • Events
  • MINOA PhD school
  • Contact
MINOA@IASI

MINOA@IASI

MINOA@IASI

  • Project
  • Recruitment
  • Publications
  • Project Team
  • Events
  • MINOA PhD school
  • Contact

Author: Claudio Gentile

Claudio Gentile

Researcher at CNR-IASI

On the Balances Minimum Evolution Problem polytope

On February 13, 2020 by Claudio Gentile

Speaker: Daniele Catanzaro Abstract: Recent advances on the polyhedral combinatorics of the Balances Minimum Evolution Problem (BMEP) enabled the characterization of a number of facets of its convex hull (also referred to as the BMEP polytope) as well as the discovery of…

No comment
Continue Reading

New MINLP Formulations for the Unit Commitment Problems with Ramping Cons traints

On December 17, 2019 by Claudio Gentile

A new paper among MINOA Partners: University of Pisa and CNR-IASI Abstract. The Unit Commitment (UC) problem in electrical power production requires to optimally operate a set of power generation units over a short time horizon (one day to a week). Operational…

No comment
Continue Reading

EXPEDIS: a new approach for solving binary quadratic problems

On November 6, 2019 by Claudio Gentile

Speaker: Nicolò GusmeroliLocation: Roma, Via dei Taurini 19, Sala Riunioni VI PianoDate:  November 7, 2019  time 11.30 Contact person: Claudio Gentile

No comment
Continue Reading

#CTW2020conference starting submissions!!

On October 8, 2019 by Claudio Gentile

For whom liked the #1stMINOAPhDschool and for whom missed it! #CTW2020conference in Ischia, June 15-27, 2020! Starting submissions on ctw2020.iasi.cnr.it

No comment
Continue Reading

Great success for #1stMINOAPhDSchool

On July 9, 2019 by Claudio Gentile

The school has been a great success: 75 students and researchers attended. See #1stMINOAPhDSchool in twitter @gentileIASICNR @MINOA_ETN to look at pictures of the event. Thanks to all participants and great thanks to all lecturers. 

No comment
Continue Reading

Yoshua Bengio received the Turing Award

On March 28, 2019 by Claudio Gentile

Citation from the ACM website: For conceptual and engineering breakthroughs that have made deep neural networks a critical component of computing. https://amturing.acm.org/award_winners/bengio_3406375.cfm. Yosha Bengio will be lecturer at the 1st MINOA PhD school  “Mixed-Integer Nonlinear Optimization meets Data Science” organized by CNR-IASI that…

No comment
Continue Reading
History and solution of Steinberg’s conjecture

History and solution of Steinberg’s conjecture

On February 26, 2019 by Claudio Gentile

Speaker: Esteban Salgado – IASI YES@IASI – Young Experts Seminars Abstract: Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. I’ll present a brief summary of the results obtained from the attempts to solve…

No comment
Continue Reading

PhD school on the theme “Mixed Integer Non Linear Optimization meets Data Science” registrations are now open.

On January 7, 2019 by Claudio Gentile

CNR-IASI, as part of the Marie Sklodowska-Curie ETN MINOA (http://minoa-itn.fau.de), announces the school for PhD students and post-docs on the theme Mixed Integer Non linear Optimization meets Data Science. The school will be held on June 24-28, 2019 in Ischia (Italy) at…

No comment
Continue Reading

The Maximum Clique Interdiction Game

On December 11, 2018 by Claudio Gentile

Speaker: Fabio Furini – LAMSADE, Université Paris Dauphine Abstract: We study the two player zero-sum Stackelberg game in which the leader interdicts (removes) a limited number of vertices from the graph, and the follower searches for the maximum clique in the interdicted…

No comment
Continue Reading

Strengthening the Sequential Convex MINLP Technique by Perspective Reformulations

On December 11, 2018 by Claudio Gentile

A new paper in collaboration among MINOA partners: CNRS-LIX, University of Pisa, and CNR-IASI. Abstract: The Sequential Convex MINLP (SC-MINLP) technique is a solution method for nonconvex Mixed-Integer NonLinear Problems where the nonconvexities are separable. It is based on solving a sequence…

No comment
Continue Reading

Posts navigation

1 2 Next

Recent Posts

  • On the Balances Minimum Evolution Problem polytope
  • New MINLP Formulations for the Unit Commitment Problems with Ramping Cons traints
  • EXPEDIS: a new approach for solving binary quadratic problems
  • #CTW2020conference starting submissions!!
  • Great success for #1stMINOAPhDSchool

Recent Comments

    Archives

    • February 2020
    • December 2019
    • November 2019
    • October 2019
    • July 2019
    • March 2019
    • February 2019
    • January 2019
    • December 2018
    • September 2018
    • August 2018

    Categories

    • Events
    • Publications
    • Uncategorized
    Copyright © 2023 MINOA@IASI - Powered By WordPress
    Designed & Developed by Sparkle Themes