Výsledky vyhledávání - "Calamita, Alice"

Report

Benders decomposition for congested partial set covering location with uncertain demand

Autor: Calamita, Alice, Ljubić, Ivana, Palagi, Laura

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of the partial set covering location problem, which involves determining a subset of facility locations to open and efficiently allocating customers to these

Externí odkaz: http://arxiv.org/abs/2401.12625

Zobrazit plný text záznamu

Report

A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems

Autor: Avella, Pasquale, Calamita, Alice, Palagi, Laura

This paper analyzes the performance of five well-known off-the-shelf optimization solvers on a set of congested capacitated facility location problems formulated as mixed-integer conic programs (MICPs). We aim to compare the computational efficiency

Externí odkaz: http://arxiv.org/abs/2303.04216

Zobrazit plný text záznamu

Report

Speeding up the solution of the Site and Power Assignment Problem in Wireless Networks

Autor: Avella, Pasquale, Calamita, Alice, Palagi, Laura

This paper addresses the site and power assignment problem arising in the optimal design of wireless networks. It is well-known that natural formulations of this problem are sources of numerical instabilities and make the optimal solution challenging

Externí odkaz: http://arxiv.org/abs/2210.04022

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Off-the-shelf solvers for mixed-integer conic programming: insights from a computational study on congested capacitated facility location instances

Autor: Avella, Pasquale, Calamita, Alice, Palagi, Laura

This paper analyzes the performance of five well-known off-the-shelf optimization solvers on a set of mixed-integer conic programs proposed for the congested capacitated facility location problem. We aim to compare the computational efficiency of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f48b8124f948544da3426c1c1ac339b

Zobrazit plný text záznamu

Membrane separation processes are a rapidly spreading technology, since they can result in energyefficient, small sized and environmental friendly processes. Their optimal design can be modelled asa MINLP problem. The resulting problem can be reduced to a small subset of NLP subproblems,under some restrictive hypotheses, and using symmetry reduction techniques. Nevertheless, each ofthese sub-problems remains challenging due to the large number of non-convex equality constraintsthat represent the physical behaviour of each membrane in the system. The aim of this phase of ourwork is to compare the original full-equation model with a machine learning hybridated model (used torepresent the single membrane behaviour) in terms of quality of solutions and computational times

Autor: Macali, Amalia, Addis, Bernardetta, Castel, Christophe, Piccialli, Veronica, Calamita, Alice, Luzio, Francesco

Publikováno v: informs
informs, Jan 2020, online, France

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::90738ad3041d40e45f67c596cec7acec
https://hal.science/hal-03902346

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání