Publications

dblp link (some publications do not appear in this list)

google scholar

 

Working papers

2023

  • N. Yellas, B. Addis, R. Riggio, and S. Secci, “In-network federated learning control,” Under revision, 2023.
    [Bibtex] 
    @article{AIF23,
author = {Yellas, N. and Addis, B. and Riggio, R. and Secci, S.},
title = {In-network Federated Learning Control},
journal = {under revision},
year = {2023}
}
  • B. Addis, G. Carello, and G. Reynal, “Management and design of wireless cellular networks with the closest assignemnt constraint: alternative formulations and heuristics,” In preparation, 2023.
    [Bibtex] 
    @article{closestassign,
author = {Addis, B. and Carello, G. and Reynal, G.},
title = {Management and design of wireless cellular networks with the closest assignemnt constraint: alternative formulations and heuristics},
journal = {in preparation},
year = {2023}
}

 

International journals and conferences with revision

2023

  • [DOI] B. Addis, C. Castel, A. Macali, R. Misener, and V. Piccialli, “Data augmentation driven by optimization for membrane separation process synthesis,” Computers & chemical engineering, p. 108342, 2023.
    [Bibtex] 
    @article{MLPS,
title = {Data augmentation driven by optimization for membrane separation process synthesis},
journal = {Computers \& Chemical Engineering},
pages = {108342},
year = {2023},
issn = {0098-1354},
doi = {https://doi.org/10.1016/j.compchemeng.2023.108342},
url = {https://www.sciencedirect.com/science/article/pii/S0098135423002120},
author = {Bernardetta Addis and Christophe Castel and Amalia Macali and Ruth Misener and Veronica Piccialli},
keywords = {Neural network, Data augmentation, Global optimization, Membrane gas separation},
abstract = {This paper proposes a new hybrid strategy to optimally design membrane separation problems. We formulate the problem as a Non-Linear Programming (NLP) model. A common approach to represent the physical behaviour of the membrane is to discretize the system of differential equations that govern the separation process. Instead, we represent the input/output behavior of the single membrane by an artificial neural network (ANN) predictor. The ANN is trained on a dataset obtained through the MEMSIC simulator. The equation form of the trained predictor (shape and weights) is then inserted in the NLP model at the place of the discretized system of differential equations. To improve the ANN accuracy without an excessive computational burden, we propose data augmentation strategies to target the regions where densify the dataset. We compare a data augmentation strategy from the literature with a novel one that densifies the dataset around the stationary points visited by a global optimization algorithm. Our approach was validated using a relevant industrial case study: hydrogen purification. Validation by simulation is performed on the obtained solutions. The computational results show that a data augmentation smartly coupled with optimization can produce a robust and reliable design tool.}
}

2022

  • [DOI] N. Yellas, B. Addis, R. Riggio, and S. Secci, “Function placement and acceleration for in-network federated learning services,” in 2022 18th international conference on network and service management (cnsm), 2022, pp. 212-218.
    [Bibtex] 
    @INPROCEEDINGS{Yellas22,
author={Yellas, N. and Addis, B. and Riggio, R. and Secci, S.},
booktitle={2022 18th International Conference on Network and Service Management (CNSM)},
title={Function Placement and Acceleration for In-Network Federated Learning Services},
year={2022},
volume={},
number={},
pages={212-218},
doi={10.23919/CNSM55787.2022.9964625}}
  • [DOI] M. Gao, Y. Li, B. Addis, G. Carello, and S. Zhuo, “Take the road back: a different way to study the NFV service chaining problem,” in 2022 ieee wireless communications and networking conference (wcnc), 2022, pp. 1266-1271.
    [Bibtex] 
    @INPROCEEDINGS{Gao22,
author={Gao, M. and Li, Y. and Addis, B. and Carello, G. and Zhuo, S.},
booktitle={2022 IEEE Wireless Communications and Networking Conference (WCNC)},
title={Take the road back: a different way to study the {NFV} service chaining problem},
year={2022},
volume={},
number={},
pages={1266-1271},
doi={10.1109/WCNC51071.2022.9771882}
}

2021

  • [DOI] B. Addis, G. Carello, and M. Gao, “ILP-based heuristics for a virtual network function placement and routing problem,” Networks, vol. 78, iss. 3, pp. 328-349, 2021.
    [Bibtex] 
    @article{ACG2021,
author = {Addis, B. and Carello, G. and Gao, M.},
title = {{ILP}-based heuristics for a virtual network function placement and routing problem},
journal = {Networks},
volume = {78},
number = {3},
pages = {328-349},
keywords = {location, matheuristics, routing, virtual network functions},
doi = {https://doi.org/10.1002/net.22073},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/net.22073},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.22073},
abstract = {Abstract Thanks to the increased availability of computing capabilities in data centers, the recently proposed virtual network function paradigm can be used to keep up with the increasing demand for network services as internet and its applications grow. The problem arises then of managing the virtual network functions, that is, to decide where to instantiate the functions and how to route the demands to reach them. While it arises in an application field, the Virtual Network Function placement and routing problem combines location and routing aspects in an interesting, challenging problem. In this paper, we propose several ILP-based heuristics and compare them on a dataset that includes instances with different sizes, network topologies, and service capacity. The heuristics prove effective in tackling even large size instances, with up to 50 nodes and more than 80 arcs.},
year = {2021}
}

2020

  • [DOI] M. Bozorg, Á. A. Ramírez-Santos, B. Addis, V. Piccialli, C. Castel, and E. Favre, “Optimal process design of biogas upgrading membrane systems: polymeric vs high performance inorganic membrane materials,” Chemical engineering science, vol. 225, p. 115769, 2020.
    [Bibtex] 
    @article{BCRAPF2020,
title = {Optimal process design of biogas upgrading membrane systems: Polymeric vs high performance inorganic membrane materials},
journal = {Chemical Engineering Science},
volume = {225},
pages = {115769},
year = {2020},
issn = {0009-2509},
doi = {https://doi.org/10.1016/j.ces.2020.115769},
url = {https://www.sciencedirect.com/science/article/pii/S0009250920303018},
author = {M. Bozorg and Álvaro A. Ramírez-Santos and B. Addis and V. Piccialli and C. Castel and E. Favre},
keywords = {Membrane, Process, Synthesis, Biogas, Purification, Cost},
abstract = {Membrane separation is a key technology for biogas purification. Multistaged processes based on either cellulose acetate (CA) or polyimide (PI) materials are classically used for this application. In this study, a systematic process synthesis optimization is performed in order to identify the most cost effective solution for three different membrane materials (CA, PI and zeolite) and three different outlet pressure levels (5, 10 and 15 Bar). It is shown that a costly (i.e. 2000 EUR per square meter vs 50 for CA and PI) but high performance membrane material such a zeolite offers the best cost effective solution compared to commercially available polymeric membranes. Increasing the outlet pressure increases the purification cost. Two stages processes with recycling loops offer the best balance between purity, recovery, complexity and cost, whatever the outlet pressure level. The use of vacuum pumping is shown to improve the process economy, while expander and extra feed compression do not show an interest.}
}
  • [DOI] B. Addis, G. Carello, and M. Gao, “On a virtual network functions placement and routing problem: some properties and a comparison of two formulations,” Networks, vol. 75, iss. 2, pp. 158-182, 2020.
    [Bibtex] 
    @article{ACG2019,
author = {Addis, B. and Carello, G. and Gao, M.},
title = {On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations},
journal = {Networks},
volume = {75},
number = {2},
pages = {158-182},
keywords = {ILP formulations, location, network routing, networks, OR in telecommunications, virtual network functions},
doi = {https://doi.org/10.1002/net.21915},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21915},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21915},
abstract = {Abstract The mass diffusion of internet applications, both from computers and mobiles, has yielded to an increasing demand for network services with which the expensive and not flexible hardware appliances cannot keep up. On the other hand, computational capability has become available on the network nodes connected with computing servers and the cloud. This has suggested the network functions virtualization paradigm: services are provided on a software basis thus giving a flexible and cost effective response to the request for services. The network functions virtualization proposes challenging optimization problems such as the virtual network functions (VNFs) chaining problem, where service instances must be located on some network nodes and each demand must be routed through the services it requires. Most of the literature is currently focused on heuristic solutions, rather than on studying the problem properties or comparing approaches. With the aim of investigating the problem properties and comparing existing formulations, both from the theoretical and the numerical points of view, we consider a single service VNFs chaining problem, with different link and service capacities and the objective of minimizing the number of installed VNF instances.},
year = {2020}
}

2019

  • [DOI] M. Bozorg, B. Addis, V. Piccialli, Á. A. Ramírez Santos, C. Castel, I. Pinnau, and E. Favre, “Polymeric membrane materials for nitrogen production from air: a process synthesis study,” Chemical engineering science, vol. 207, pp. 1196-1213, 2019.
    [Bibtex] 
    @article{BAPRCPF19,
title = "Polymeric membrane materials for nitrogen production from air: A process synthesis study",
journal = "Chemical Engineering Science",
volume = "207",
pages = "1196 - 1213",
year = "2019",
issn = "0009-2509",
doi = "https://doi.org/10.1016/j.ces.2019.07.029",
url = "http://www.sciencedirect.com/science/article/pii/S0009250919306013",
author = "Bozorg, M. and Addis, B. and Piccialli, V. and Ram\'irez Santos, \'A. A. and Castel, C. and Pinnau, I. and Favre, E.",
keywords = "Nitrogen, Membrane, Process, Synthesis, Optimization, Materials, Cost",
abstract = "Nitrogen production from air by membrane gas separation processes is a mature technology which is applied in numerous industrial sectors (chemical, food, aeronautics, space..). Depending on the nitrogen purity requirements (typically between 90 and 99.9%), single stage or multistage membrane process configurations are used. A very large number of advanced membrane materials have been recently reported, showing increasing permeability and/or selectivity for air separation applications (i.e. trade-off limits of dense polymeric materials for the O2/N2 gas pair) compared to the commercially available membranes. The interest of these new materials in terms of nitrogen production cost and their impact in terms of process configuration are reported through a process synthesis study. Based on a tailor made optimization methodology and program, the production cost and associated optimal process configuration are first identified for two standard O2/N2 separation membranes at four different levels of N2 purity (90, 95, 99, 99.9%). The same strategy is then performed with advanced trade-off membrane materials, with the possibility to combine different materials in multistaged systems. The impact in terms of nitrogen production cost for the different purities and the corresponding optimal membrane materials and process configurations are discussed. Surprisingly, a medium membrane selectivity combined to a high permeability is shown to systematically offer the best set of performances, for mono or multistaged systems. Vacuum operation and recycling loops are shown to generate lower N2 production costs."
}

2018

  • [DOI] Á. A. Ramírez Santos, M. Bozorg, B. Addis, V. Piccialli, C. Castel, and E. Favre, “Optimization of multistage membrane gas separation processes. Example of application to CO2 capture from blast furnace gas,” Journal of Membrane Science, vol. 566, p. 346–366, 2018.
    [Bibtex] 
    @article{ARPBCF18,
author = {Ram\'irez Santos, \'A. A. and Bozorg, M. and Addis, B. and Piccialli, V. and Castel, C. and Favre, E.},
title = {Optimization of multistage membrane gas separation processes. {E}xample of application to {CO2} capture from blast furnace gas},
year = {2018},
journal = {Journal of {M}embrane {S}cience},
pages ={346--366},
volume = {566},
doi = "https://doi.org/10.1016/j.memsci.2018.08.024"
}
  • [DOI] M. Gao, B. Addis, M. Bouet, and S. Secci, “Optimal orchestration of virtual network functions,” Computer networks, vol. 142, p. 108–127, 2018.
    [Bibtex] 
    @article{GABS18,
title = "Optimal orchestration of virtual network functions",
journal = "Computer Networks",
volume = "142",
pages = "108--127",
year = "2018",
issn = "1389-1286",
doi = "https://doi.org/10.1016/j.comnet.2018.06.006",
url = "http://www.sciencedirect.com/science/article/pii/S1389128618303578",
author = "Gao, M. and Addis, B. and Bouet, M. and Secci, S.",
keywords = "Network functions virtualization, VNF orchestration, VNF chaining, VNF placement",
abstract = "The emergence of Network Functions Virtualization (NFV) is bringing a set of novel algorithmic challenges in the operation of communication networks. NFV introduces volatility in the management of network functions, which can be dynamically orchestrated, i.e., placed, resized, etc. Virtual Network Functions (VNFs) can belong to VNF chains, where nodes in a chain can serve multiple demands coming from the network edges. In this paper, we formally define the VNF placement and routing (VNF-PR) problem, proposing a versatile linear programming formulation that is able to accommodate specific features and constraints of NFV infrastructures, and that is substantially different from existing virtual network embedding formulations in the state of the art. We also design a math-heuristic able to scale with multiple objectives and large instances. By extensive simulations, we draw conclusions on the trade-off achievable between classical traffic engineering (TE) and NFV infrastructure efficiency goals, evaluating both Internet access and Virtual Private Network (VPN) demands. We do also quantitatively compare the performance of our VNF-PR heuristic with the classical Virtual Network Embedding (VNE) approach proposed for NFV orchestration, showing the computational differences, and how our approach can provide a more stable and closer-to-optimum solution."
}
  • [DOI] B. Addis, M. Gao, and G. Carello, “On the complexity of a virtual network function placement and routing problem,” Electronic notes in discrete mathematics, vol. 69, p. 197–204, 2018.
    [Bibtex] 
    @article{ACG18,
title = "On the complexity of a Virtual Network Function Placement and Routing problem",
journal = "Electronic Notes in Discrete Mathematics",
volume = "69",
pages = "197--204",
year = "2018",
mynote = "Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018)",
issn = "1571-0653",
doi = "https://doi.org/10.1016/j.endm.2018.07.026",
url = "http://www.sciencedirect.com/science/article/pii/S1571065318301707",
author = "Addis, B. and Gao, M. and Carello, G.",
keywords = "Virtual Network Functions, complexity, placement and routing",
abstract = "The demand for network services, such as proxy or firewall, is ever increasing due to the massive diffusion of applications, both on computers and mobile devices. Virtual Network Functions allow to instantiate network services on clouds in a software based manner, thus allowing to dynamically provide services at a reasonable cost. In this work we consider the problem of placing Virtual Network Function instances (services) and routing the demands so as to guarantee that demands can reach the requested services. We discuss the complexity of a particular version of the Virtual Network Function placement and routing problem and the impact of the network topology on the problem complexity."
}

2017

  • B. Addis, G. Carello, and S. Mattia, “Survivable green traffic engineering with shared protection,” Networks, vol. 69, p. 6–22, 2017.
    [Bibtex] 
    @article{ACM16b,
author = {Addis, B. and Carello, G. and Mattia, S.},
title = {Survivable green traffic engineering with shared protection},
journal = {Networks},
volume = {69},
issue ={1},
pages = {6--22},
year = 2017
}

2016

  • [DOI] B. Addis, G. Carello, and S. Mattia, “Energy-aware survivable networks,” Electronic notes in discrete mathematics, vol. 52, p. 133–140, 2016.
    [Bibtex] 
    @article{ACM16,
title = "Energy-aware survivable networks",
journal = "Electronic Notes in Discrete Mathematics",
volume = "52",
pages = "133--140",
year = "2016",
mynote = "INOC 2015 – 7th International Network Optimization Conference",
issn = "1571-0653",
doi = "https://doi.org/10.1016/j.endm.2016.03.018",
url = "http://www.sciencedirect.com/science/article/pii/S1571065316300233",
author = "Addis, B. and Carello, G. and Mattia, S.",
keywords = "energy aware networking, shared protection, branch-and-cut"
}
  • B. Addis, A. Capone, G. Carello, L. G. Gianoli, and B. Sansò, “Energy management in communication networks: a journey through modeling and optimization glasses,” Computer communications, vol. 91-92, p. 76–94, 2016.
    [Bibtex] 
    @article{ACCGS16,
title = "Energy management in communication networks: a journey through modeling and optimization glasses ",
journal = "Computer Communications ",
volume = "91-92",
number = "",
pages = "76--94",
year = "2016",
note = "",
issn = "0140-3664",
author = "B. Addis and A. Capone and G. Carello and L.G. Gianoli and B. Sans\`o",
keywords = "Energy-aware",
keywords = "Traffic engineering",
keywords = "Network management",
keywords = "Network design",
keywords = "Network optimization ",
abstract = "Abstract The widespread proliferation of Internet and wireless applications has produced a significant increase of \{ICT\} energy footprint. As a response, in the last years, significant efforts have been undertaken to include energy-awareness into network management. Several green networking frameworks consisting in carefully managing the network routing and the power state of network devices have been proposed. Even though the approaches differ on the technologies and sleep modes adopted, they all aim at tailoring the active network resources to the varying traffic needs in order to minimize energy consumption. From a modeling standpoint, this has several commonalities with classical network design and routing problems, even if with different objectives and in a dynamic context. While most research has focused on crucial technological aspects of the green networking schemes, there has been little attention so far on the understanding of the modeling similarities and differences of the proposed solutions. This paper fills the gap by surveying the literature on wired networks energy management with optimization modeling glasses. It follows a tutorial approach that guides through the different components of the models with a unified symbolism. A detailed classification of previous work based on the included modeling issues is also proposed. "
}
  • [DOI] B. Addis, R. Aringhieri, A. Grosso, and P. Hosteins, “Hybrid constructive heuristics for the critical node problem,” Annals of operations research, vol. 238, iss. 1, p. 637–649, 2016.
    [Bibtex] 
    @article{AAGH16,
author="Addis, B.
and Aringhieri, R.
and Grosso, A.
and Hosteins, P.",
title="Hybrid constructive heuristics for the critical node problem",
journal="Annals of Operations Research",
year="2016",
volume="238",
number="1",
pages="637--649",
abstract="We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple hybrid heuristic algorithms. The obtained algorithms are shown to be effective, delivering improved performances (solution quality and speed) with respect to known greedy algorithms and other more sophisticated state of the art methods.",
issn="1572-9338",
doi="10.1007/s10479-016-2110-y",
}
  • [DOI] B. Addis, G. Carello, A. Grosso, and E. Tànfani, “Operating room scheduling and rescheduling: a rolling horizon approach,” Flexible services and manufacturing journal, vol. 28, iss. 1, p. 206–232, 2016.
    [Bibtex] 
    @article{ACGT16,
author="Addis, B.
and Carello, G.
and Grosso, A.
and T{\`a}nfani, E.",
title="Operating room scheduling and rescheduling: a rolling horizon approach",
journal="Flexible Services and Manufacturing Journal",
year="2016",
volume="28",
number="1",
pages="206--232",
abstract="In this work we consider the problem of selecting a set of patients among a given waiting list of elective patients and assigning them to a set of available operating room blocks. We assume a block scheduling strategy in which the number and the length of available blocks are given. As each block is related to a specific day, by assigning a patient to a block his/her surgery date is fixed, as well. Each patient is characterized by a recommended maximum waiting time and an uncertain surgery duration. In practical applications, new patients enter the waiting list continuously. Patient selection and assignment is performed by surgery departments on a short-term, usually a week, regular base. We propose a so-called rolling horizon approach for the patient selection and assignment. At each iteration short-term patient assignment is decided. However, in a look-ahead perspective, a longer planning horizon is considered when looking for the patient selection. The mid-term assignment over the next {\$}{\$}n{\$}{\$} n weeks is generated by solving an ILP problem, minimizing a penalty function based on total waiting time and tardiness of patients. The approach is iteratively applied by shifting ahead the mid-term planning horizon. When applying the first week solution, unpredictable extensions of surgeries may disrupt the schedule. Such disruptions are recovered in the next iteration: the mid-term solution is rescheduled limiting the number of variations from the previously computed plan. Besides, the approach allows to deal with new patient arrivals. To keep limited the number of disruptions due to uncertain surgery duration, we propose also a robust formulation of the ILP problem. The deterministic and the robust formulation based frameworks are compared over a set of instances, including different stochastic realization of surgery times.",
issn="1936-6590",
doi="10.1007/s10696-015-9213-7",
url="http://dx.doi.org/10.1007/s10696-015-9213-7"
}
  • E. Tsiontsiou, B. Addis, A. Ceselli, and Y. Song, “Optimal probabilistic energy-aware routing for duty-cycled wireless sensor networks,” in Proc. of ntms 2016, mobility and wireless track, 2016.
    [Bibtex] 
    @inproceedings{TACS16,
title = {Optimal Probabilistic Energy-Aware Routing for Duty-Cycled Wireless Sensor Networks},
author = {Tsiontsiou, E. and Addis, B. and Ceselli, A. and Song, Y.},
booktitle = {Proc. of NTMS 2016, Mobility and Wireless Track},
year = 2016
}

2015

  • [DOI] B. Addis, G. Carello, A. Grosso, E. Lanzarone, S. Mattia, and E. Tànfani, “Handling uncertainty in health care management using the cardinality-constrained approach: advantages and remarks,” Operations research for health care, vol. 4, p. 1–4, 2015.
    [Bibtex] 
    @article{AetAll15,
title = "Handling uncertainty in health care management using the cardinality-constrained approach: Advantages and remarks ",
journal = "Operations Research for Health Care ",
volume = "4",
number = "",
pages = "1--4",
year = "2015",
note = "",
issn = "2211-6923",
doi = "http://dx.doi.org/10.1016/j.orhc.2014.10.001",
url = "http://www.sciencedirect.com/science/article/pii/S221169231420018X",
author = "Addis, B. and Carello, G. and Grosso, A. and Lanzarone, E. and Mattia, S. and T{\`a}nfani, E.",
keywords = "Robustness",
keywords = "Cardinality-constrained approach",
keywords = "Surgical case assignment",
keywords = "Continuity in home care ",
abstract = "Abstract Different approaches have been proposed in the literature to handle uncertain parameters in health care optimisation problems. Among them, the cardinality-constrained approach to robust optimisation seems suitable for handling several of these problems because it allows a trade-off between the level of robustness and the cost of the solution, and an easy implementation that can be understood by clinicians and planners without any background in operations research. Thus far, however, cardinality-constrained approach has rarely been applied to health care. We recently applied the cardinality-constrained approach to two relevant health care management problems, namely, the operating room planning problem and the nurse-to-patient assignment problem in home care services. In this communication, we briefly describe our experience and focus on general considerations, advantages, and remarks that can help operations researchers in evaluating the approach for other applications in health care management. "
}
  • B. Addis, D. Belabed, M. Bouet, and S. Secci, “Virtual network functions placement and routing optimization,” in Proc. of ieee cloudnet 2015, 2015.
    [Bibtex] 
    @inproceedings{ABBS15,
author = {Addis, B. and Belabed, D. and Bouet, M and Secci, S.},
title = {Virtual Network Functions Placement and Routing Optimization},
booktitle = { Proc. of IEEE CLOUDNET 2015},
myplace = {Niagara Falls, Canada},
year = {2015},
mydate = {Oct. 5-7},
mycompletename = {IEEE Cloud Networking Conference}
}

2014

  • B. Addis, D. Ardagna, A. Capone, and G. Carello, “Energy-aware joint management of network and cloud infrastructures,” Computer networks, vol. 70, p. 75–95, 2014.
    [Bibtex] 
    @article{AACC14,
author = {Addis, B. and Ardagna, D. and Capone, A. and Carello, G.},
title = {Energy-aware joint management of network and cloud infrastructures},
year = {2014},
volume = 70,
journal = {Computer Networks},
pages = {75--95}
}
  • B. Addis, A. Capone, G. Carello, L. Gianoli, and B. Sansò, “On the energy cost of network protection techniques,” Computer networks, vol. 75, p. 239–259, 2014.
    [Bibtex] 
    @article{ACCGS14,
author = {Addis, B. and Capone, A. and Carello, G. and Gianoli, L. and Sans\`o, B.},
title = {On the energy cost of network protection techniques},
year = {2014},
volume = 75,
issue = {A},
journal = {Computer Networks},
pages = {239--259}
}
  • [DOI] B.~Addis, A.~Capone, G.~Carello, L.G.~Gianoli, and B.~Sansó, “Energy management through optimized routing and device powering for greener communication networks,” Ieee/acm transactions on networking, vol. 22, iss. 1, p. 313–325, 2014.
    [Bibtex] 
    @article{ACCGS14b,
author = {B.~Addis and A.~Capone and G.~Carello and L.G.~Gianoli and B.~Sans\'o},
doi = {10.1109/TNET.2013.2249667},
issn = {1063-6692},
journal = {IEEE/ACM Transactions on Networking},
month = feb,
number = {1},
pages = {313--325},
title = {Energy Management Through Optimized Routing and Device Powering for Greener Communication Networks},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6490068},
volume = {22},
year = {2014}
}
  • D. Izzo, L. F. Simões, C. H. Yama, F. Biscani, D. Di Lorenzo, B. Addis, and A. Cassioli, “GTOC5: results from the european space agency’s advanced concepts team and university of florence global optimization laboratory,” Acta futura, vol. 8, p. 45–55, 2014.
    [Bibtex] 
    @article{ISYBdLAC13,
author = {Izzo, D. and Sim\~oes, L. F. and Yama, C. H. and Biscani, F. and Di Lorenzo, D. and Addis, B. and Cassioli, A.},
title ={{GTOC5}: Results from the European Space Agency's Advanced Concepts Team and University of Florence Global Optimization Laboratory},
year = {2014},
journal = {Acta Futura},
volume = 8,
pages = {45--55}
}
  • B. Addis, G. Carello, and E. Tànfani, “A robust optimization approach for the operating room planning problem with uncertain surgery durations,” in Proceedings of the international conference on health care systems engineering, 2014.
    [Bibtex] 
    @inproceedings{ACT14,
author = {Addis, B. and Carello, G. and T\`anfani, E.},
title = {A robust optimization approach for the Operating Room Planning Problem with uncertain surgery durations},
booktitle ={Proceedings of the International Conference on Health Care Systems Engineering},
publisher ={Series: Springer Proceedings in Mathematics \& Statistics},
myeditors = {Matta, A.; Li, J.; Sahin, E.; Lanzarone, E.; Fowler, J.},
myplace = { Milan, Italy},
year = {2014},
volume = 61
}

2013

  • B. Addis, M. Di Summa, and A. Grosso, “Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth,” Discrete and applied mathematics, vol. 161, p. 2349–2360, 2013.
    [Bibtex] 
    @article{AdSG13,
author = {Addis, B. and Di Summa, M. and Grosso, A.},
title = {Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth},
year = {2013},
journal ={Discrete and Applied Mathematics},
volume = 161,
issue = {16--17},
pages = {2349--2360}
}
  • B. Addis, G. Carello, and A. Ceselli, “Combining very large scale and ILP based neighborhoods for a two-level location problem,” European journal of operational research, vol. 231, p. 535–546, 2013.
    [Bibtex] 
    @article{ACC13,
author = {B. Addis and G. Carello and A. Ceselli},
title = {Combining Very Large Scale and {ILP} based neighborhoods for a Two-level Location Problem},
journal = {European Journal of Operational Research},
volume = 231,
issue = 3,
pages = {535--546},
year = {2013}
}
  • B. Addis, D. Ardagna, B. Panicucci, M. Squillante, and Z. L., “A hierarchical approach for the resource management of very large cloud platforms,” Ieee transactions on dependable and secure computing, vol. 10, p. 253–272, 2013.
    [Bibtex] 
    @article{AAPSZ13,
author = {Addis, B. and Ardagna, D. and Panicucci, B. and Squillante, M. and Zhang L.},
title = {A Hierarchical Approach for the Resource Management of Very Large Cloud Platforms},
year = {2013},
journal = {IEEE Transactions on Dependable and Secure Computing},
volume = 10,
issue = 5,
pages = {253--272}
}
  • B. Addis, A. Capone, G. Carello, L. Gianoli, and B. Sansò, “A robust optimization approach for energy-aware routing in mpls networks,” in Proceedings of ieee icnc 2013, 2013.
    [Bibtex] 
    @INPROCEEDINGS{ACCGS2013,
author = {Addis, B. and Capone, A. and Carello, G. and Gianoli, L. and Sans\`o, B.},
title = {A robust optimization approach for energy-aware routing in MPLS networks},
year = {2013},
month = {January},
booktitle = {Proceedings of IEEE ICNC 2013}
}

2012

  • B. Addis, G. Carello, and A. Ceselli, “Exactly solving a two-level hierarchical location problem with modular node capacities,” Networks, vol. 1, p. 161–180, 2012.
    [Bibtex] 
    @article{ACC12,
author = {B. Addis and G. Carello and A. Ceselli},
title = {Exactly solving a Two-level Hierarchical Location Problem with modular node capacities},
journal = {Networks},
year = {2012},
issue = 59,
volume = 1,
pages = {161--180}
}
  • B. Addis, A. Capone, G. Carello, L. Gianoli, and B. Sansò, “Multi-period traffic engineering of resilient networks for energy efficiency,” in Proceedings of ieee greencom 2012, 2012.
    [Bibtex] 
    @INPROCEEDINGS{ACCGS2012b,
author = {Addis, B. and Capone, A. and Carello, G. and Gianoli, L. and Sans\`o, B.},
title = { Multi-period Traffic Engineering of Resilient Networks for Energy efficiency},
year = {2012},
month = {September},
booktitle = {Proceedings of IEEE GreenCom 2012}
}
  • B. Addis, A. Capone, G. Carello, L. Gianoli, and B. Sansò, “Energy aware management of resilient networks with shared protection,” in Sustainable internet and ict for sustainability (sustainit), 2012, 2012, pp. 1-9.
    [Bibtex] 
    @INPROCEEDINGS{ACCGS2012c,
author={Addis, B. and Capone, A. and Carello, G. and Gianoli, L. and Sans\`o, B.},
booktitle={Sustainable Internet and ICT for Sustainability (SustainIT), 2012},
title={Energy aware management of resilient networks with shared protection},
year={2012},
mymonth={oct.},
volume={},
number={},
pages={1-9},
keywords={},
doi={},
ISSN={},}
  • B. Addis, A. Capone, G. Carello, L. Gianoli, and B. Sansò, “Energy-aware multiperiod traffic engineering with flow-based routing,” in Proceedings of ieee icc 2012 (workshop on green communications and networking – gcn), 2012, p. 5957–5961.
    [Bibtex] 
    @INPROCEEDINGS{ACCGS2012a,
title = {Energy-Aware Multiperiod Traffic Engineering with Flow-based Routing},
author = {B. Addis and Capone, A. and Carello, G. and Gianoli, L. and Sans\`o, B.},
year = {2012},
booktitle = {Proceedings of IEEE ICC 2012 (workshop on Green Communications and Networking - GCN)},
pages = {5957--5961}
}

2011

  • B. Addis, G. Carello, and F. Malucelli, “SRG-disjoint design with dedicated and shared protection,” in Lecture notes in computer science, 2011, p. 18–23.
    [Bibtex] 
    @inproceedings{ACM11,
author = {Addis, B. and Carello, G. and Malucelli, F.},
title = {{SRG}-disjoint design with dedicated and shared protection},
booktitle = {Lecture Notes in Computer Science},
pages ={18--23},
year = 2011
}

2010

  • B. Addis and W. Schachinger, “Morse potential energy minimization: improved bounds for optimal configurations,” Computational optimization and applications, vol. 47, p. 129–131, 2010.
    [Bibtex] 
    @article {AS10,
author = {B. Addis and W. Schachinger},
title = {Morse potential energy minimization: Improved bounds for optimal configurations},
journal = {Computational Optimization and Applications},
volume = {47},
pages = {129--131},
year = {2010}
}
  • B. Addis, D. Ardagna, B. Panicucci, and L. Zhang, “Autonomic management of cloud service centers with availability guarantees.,” in Proc. of the 4th ieee international conference on cloud computing, 2010, p. 220–227.
    [Bibtex] 
    @INPROCEEDINGS{AAPZ10,
title = {Autonomic Management of Cloud Service Centers with Availability Guarantees.},
author = {B. Addis and D. Ardagna and B. Panicucci and L. Zhang},
year = {2010},
booktitle = {Proc. of the 4th IEEE International Conference on Cloud Computing},
place= {Miami, Florida, USA.},
pages = {220--227}
}

2009

  • B. Addis and W. Schachinger, “Improved bounds for interatomic distance in morse clusters,” Operations research letters, vol. 37, p. 290–294, 2009.
    [Bibtex] 
    @article {AS09,
author = {B. Addis and W. Schachinger},
title = {Improved bounds for interatomic distance in Morse clusters},
journal = {Operations Research Letters},
volume = {37},
pages = {290--294},
year = {2009}
}
  • B. Addis, A. Cassioli, M. Locatelli, and F. Schoen, “A global optimization method for design of space trajectories,” Computational optimization and applications, 2009.
    [Bibtex] 
    @article{ ACLS09,
author = {B. Addis and A. Cassioli and M. Locatelli and F. Schoen},
title = {A Global Optimization method for Design of Space Trajectories},
journal = {Computational Optimization and Applications},
year = {2009}
}

2008

  • B. Addis, M. Locatelli, and F. Schoen, “Disk packing in a square: a new global optimization approach.,” Informs journal on computing, vol. 20, p. 516–524, 2008.
    [Bibtex] 
    @ARTICLE {ALS08a,
title = {Disk packing in a square: a new global optimization approach.},
author = {Addis, B. and Locatelli, M. and Schoen, F.},
journal = {INFORMS Journal on Computing},
year = {2008},
month = {},
volume = {20},
number = {},
pages = {516--524},
abstract = {},
}
  • B. Addis, M. Locatelli, and F. Schoen, “Efficiently packing unequal disks in a circle.,” Operations research letters, vol. 36, p. 37–42, 2008.
    [Bibtex] 
    @ARTICLE {ALS08b,
title = {Efficiently packing unequal disks in a circle.},
author = {Addis, B. and Locatelli, M. and Schoen, F.},
journal = {Operations Research Letters},
year = {2008},
month = {},
volume = {36},
number = {},
pages = {37--42},
abstract = {},
}
  • B. Addis, A. Capone, G. Carello, F. Malucelli, M. Fumagalli, and E. Pedrinelli, “Designing two-layer optical networks with statistical multiplexing,” Fiber and integrated optics, vol. 27, p. 249–255, 2008.
    [Bibtex] 
    @article {ACCMFP08,
author = {B. Addis and A. Capone and G. Carello and F. Malucelli and M. Fumagalli and E. Pedrinelli},
title = {Designing Two-layer Optical Networks with Statistical Multiplexing},
journal = {Fiber and Integrated Optics},
volume ={27},
issue ={4},
pages ={249--255},
year = {2008},
}

2007

  • W. Schachinger, B. Addis, I. M. Bomze, and F. Schoen, “New results for molecular formation under pairwise potential minimization,” Computational optimization and applications, vol. 38, p. 329–349, 2007.
    [Bibtex] 
    @article{SABS07,
author = {Schachinger, W. and Addis, B. and Bomze, I. M. and Schoen, F.},
title = {New results for molecular formation under pairwise potential minimization},
journal = {Computational Optimization and Applications},
volume = {38},
issue = {3},
pages = {329--349},
year = {2007}
}
  • B. Addis and M. Locatelli, “A new class of test functions for global optimization,” Journal of global optimization, vol. 38, p. 479–501, 2007.
    [Bibtex] 
    @article {AL07,
author = {B. Addis and M. Locatelli},
title = {A new class of test functions for global optimization},
journal = {Journal of Global Optimization},
volume = {38},
issue = {3},
pages = {479--501},
year = {2007}
}

2006

  • B. Addis and S. Leyffer, “A trust-region algorithm for global optimization,” Computational optimization and applications, vol. 35, p. 287–304, 2006.
    [Bibtex] 
    @ARTICLE{AL06,
author = {B. Addis and S. Leyffer},
title ={A Trust-Region Algorithm for Global Optimization},
journal = {Computational Optimization and Applications},
volume = {35},
pages ={287--304},
year = {2006}
}

2005

  • B. Addis, M. Locatelli, and F. Schoen, “Local optima smoothing for global optimization,” Optimization methods and software, vol. 20, p. 417–437, 2005.
    [Bibtex] 
    @ARTICLE{ALS05,
author = {B. Addis and M. Locatelli and F. Schoen},
title = {Local optima smoothing for global optimization},
journal = {Optimization Methods and Software},
volume = {20},
issue = {4-5},
pages = {417--437},
year ={2005}
}

2004

  • B. Addis and F. Schoen, “Docking of atomic clusters through nonlinear optimization,” J. of global optimization, vol. 30, p. 1–21, 2004.
    [Bibtex] 
    @ARTICLE{AS04,
author = {B. Addis and F. Schoen},
title = {Docking of atomic clusters through nonlinear optimization},
journal = {J. of Global Optimization},
volume = {30},
issue = {1},
pages ={1--21},
year ={2004}
}

 

Other publications (conference proceedings, books, etc.)

2019

  • B. Addis, A journey through optimization: from global to discrete optimization and back, Hdr – universitè de lorraine, iaem, 2019.
    [Bibtex] 
    @BOOK{AddisHDR,
author = "B. Addis",
title = "A journey through optimization: from global to discrete optimization and back",
publisher = {HDR - Universit\`e de Lorraine, IAEM},
year = 2019
}

2016

  • M. Krzaczkowska, B. Addis, R. Bounaceur, E. Favre, A. Oulamara, and V. Piccialli, “An optimization framework for membrane system automatic parameter tuning,” in 17ème conférence de la société française de recherche opérationelle et aide à la décision, 2016.
    [Bibtex] 
    @inproceedings{Magda16,
author = {Krzaczkowska, M. and Addis, B. and Bounaceur, R. and Favre, E. and Oulamara, A. and Piccialli, V.},
title = {An optimization framework for membrane system automatic parameter tuning},
booktitle ={17\`eme conf\'erence de la Soci\'et\'e Fran{\c{c}}aise de Recherche Op\'erationelle et Aide \`a la D\'ecision},
year = 2016
}

2015

  • B. Addis, C. Carello, and G. La Rosa, “An energy-aware management and design problem in wireless cellular networks,” in International network optimization conference 2015, 2015.
    [Bibtex] 
    @inproceedings{ACLR15,
author = {Addis, B. and Carello, C. and La Rosa, G.},
title = {An energy-aware management and design problem in wireless cellular networks},
year = 2015,
booktitle = {International Network Optimization Conference 2015},
place = {Warsaw, Poland},
mydate = {May 18-20}
}
  • B. Addis, C. Carello, and M. Raco, “Heuristics for an energy-aware management problem in cellular networks,” in 16ème conférence de la société française de recherche opérationelle et aide à la décision, 2015.
    [Bibtex] 
    @inproceedings{ACR15,
author = {Addis, B. and Carello, C. and Raco, M.},
title = { Heuristics for an energy-aware management problem in cellular networks},
year = 2015,
booktitle = {16\`eme conf\'erence de la Soci\'et\'e Fran{\c{c}}aise de Recherche Op\'erationelle et Aide \`a la D\'ecision},
place = {Marseille, France},
mydate = {February 25-27}
}

2013

  • B. Addis, G. Carello, and E. Tànfani, “A robust optimization approach for the operating room planning problem with uncertain surgery durations,” in 14ème conférence de la société française de recherche opérationelle et aide à la décision, 2013.
    [Bibtex] 
    @inproceedings{ACT13,
author = {Addis, B. and Carello, G. and T\`anfani, E.},
title = {A robust optimization approach for the Operating Room Planning Problem with uncertain surgery durations},
booktitle ={14\`eme conf\'erence de la Soci\'et\'e Fran{\c{c}}aise de Recherche Op\'erationelle et Aide \`a la D\'ecision},
year = 2013
}

2011

  • B. Addis, G. Carello, and F. Malucelli, “Srg-disjoint design with dedicated and shared protection,” in International network optimization conference 2011, 2011.
    [Bibtex] 
    @inproceedings{ACM11a,
author = {Addis, B. and Carello, G. and Malucelli, F.},
title = {SRG-Disjoint Design with Dedicated and Shared Protection},
booktitle = {International Network Optimization Conference 2011},
year = 2011,
place = {Hamburg, Germany},
mydate = {June 13-16},
mypages = {18-23}
}
  • B. Addis, G. Carello, and F. Malucelli, “Network design with SRG based protection,” in Proc. of the 10th cologne-twente workshop on graphs and combinatorial optimization. extended abstracts, 2011.
    [Bibtex] 
    @inproceedings{ACM11b,
author = {Addis, B. and Carello, G. and Malucelli, F.},
title = {Network design with {SRG} based protection},
year = 2011,
booktitle = {Proc. of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts},
place = {Villa Mondragone, Frascati, Italy},
mydate = {June 14-16}
}
  • B. Addis, R. Aringhieri, M. Gribaudo, and A. Grosso, “Combining petri nets and metaheuristics for the optimal composition of medical teams,” in Proceeding 9th metaheuristics international conference, 2011.
    [Bibtex] 
    @inproceedings{AAGG11,
author = {Addis, B. and Aringhieri, R. and Gribaudo, M. and Grosso, A.},
title = { Combining petri nets and metaheuristics for the optimal composition of medical teams},
booktitle = {Proceeding 9th Metaheuristics International Conference},
year = 2011,
mymonth = July
}
  • B. Addis, R. Aringhieri, G. Carello, M. Gribaudo, and A. Grosso, “Advanced workforce management in healthcare,” in Proceedings orahs 2011, 2011, p. 308–319.
    [Bibtex] 
    @inproceedings{AACGG11,
author = {Addis, B. and Aringhieri, R. and Carello, G. and Gribaudo, M. and Grosso, A.},
title = {Advanced workforce management in healthcare},
booktitle = {Proceedings ORAHS 2011},
pages ={308--319},
year = 2011
}

2005

  • B. Addis, “Global optimization using local searches,” PhD Thesis, Università degli Studi di Firenze, 2005.
    [Bibtex] 
    @PHDTHESIS{ Addis,
author = "B. Addis",
title = "Global optimization using local searches",
institution = "Universit\`a degli Studi di Firenze",
school = {Computer Science and Automation Engineering},
mydept = {Dipartimento di Sistemi e Informatica},
year = 2005
}