Andrea Scozzari

Ecol. Informatics, December, 2023

The Application of SWAT Model and Remotely Sensed Products to Characterize the Dynamic of Streamflow and Snow in a Mountainous Watershed in the High Atlas.

[BibT_eX]

[DOI]

Sensors, February, 2023

2022

Cardinality constrained connected balanced partitions of trees under different criteria.

[BibT_eX]

[DOI]

Roberto Cordone

Davide Franchi

Discret. Optim., 2022

A combinatorial optimization approach to scenario filtering in portfolio selection.

[BibT_eX]

[DOI]

Moisés Rodríguez-Madrena

Comput. Oper. Res., 2022

2021

Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On finding connected balanced partitions of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

An optimization-diversification approach to portfolio selection.

[BibT_eX]

[DOI]

Francesco Cesarone

J. Glob. Optim., 2020

Clustering and portfolio selection problems: A unified framework.

[BibT_eX]

[DOI]

Moisés Rodríguez-Madrena

Comput. Oper. Res., 2020

Lake water level estimated by a purely radiometric measurement: an experiment with the SLSTR radiometer onboard Sentinel-3 satellites.

[BibT_eX]

[DOI]

Stefano Vignudelli

Abdelazim M. Negm

Proceedings of the 2020 IEEE International Instrumentation and Measurement Technology Conference, 2020

2019

What Differentiates Poor and Good Outcome Psychotherapy? A Statistical-Mechanics-Inspired Approach to Psychotherapy Research.

[BibT_eX]

[DOI]

Syst., 2019

Total Distance, Wiener Index and Opportunity Index in Wreath Products of Star Graphs.

[BibT_eX]

[DOI]

Matteo Cavaleri

Alfredo Donno

Electron. J. Comb., 2019

2018

Uniform and most uniform partitions of trees.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Complexity of some graph-based bounds on the probability of a union of events.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Mathematical programming formulations for the efficient solution of the <i>k</i>-sum approval voting problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

Alternating Current Optimal Power Flow with Generator Selection.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

Envisat RA-2 Individual Echoes: A Unique Dataset for a Better Understanding of Inland Water Altimetry Potentialities.

[BibT_eX]

[DOI]

Ron Abileah

Stefano Vignudelli

Remote. Sens., 2017

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

On exact and approximate stochastic dominance strategies for portfolio selection.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem.

[BibT_eX]

[DOI]

CoRR, 2017

A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2017

Making use of continuous measurements for change detection purposes: an application to water distribution networks.

[BibT_eX]

[DOI]

Gianpiero Brozzo

Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2017

2016

Detection and Characterization of Ship Targets Using CryoSat-2 Altimeter Waveforms.

[BibT_eX]

[DOI]

Remote. Sens., 2016

Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria.

[BibT_eX]

[DOI]

Networks, 2016

Algorithms for uniform centered partitions of trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Development of an online measurement apparatus for the study of stratified flow in near-horizontal pipes.

[BibT_eX]

[DOI]

Paolo Andreussi

Daniele Picciaia

Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2016

2015

A linear risk-return model for enhanced indexation in portfolio optimization.

[BibT_eX]

[DOI]

OR Spectr., 2015

Linear vs. quadratic portfolio selection models with hard real-world constraints.

[BibT_eX]

[DOI]

Francesco Cesarone

Comput. Manag. Sci., 2015

Non-invasive measurements for shallow depth soil exploration: Development and application of an electromagnetic induction instrument.

[BibT_eX]

[DOI]

Yuri A. Manstein

Alexander K. Manstein

Evgeniy Balkov

Grigory Panin

Proceedings of the 2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) Proceedings, 2015

2014

Polynomially Computable Bounds for the Probability of the Union of Events.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Reliability problems in multiple path-shaped facility location on networks.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Unreliable point facility location problems on networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Bidimensional allocation of seats via zero-one matrices with given line sums.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

Analysis of vegetation dynamics in middle east area during 2002-2013 in relation to the 2007-2009 drought episode.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Geoscience and Remote Sensing Symposium, 2014

Experimentation of a tomographic technique on envisat radar altimetry data: Oil platforms as an opportunity target.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Geoscience and Remote Sensing Symposium, 2014

2013

Exact and heuristic approaches for the index tracking problem with UCITS constraints.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

A new method for mean-variance portfolio optimization with cardinality constraints.

[BibT_eX]

[DOI]

Francesco Cesarone

Ann. Oper. Res., 2013

2012

Network flow methods for electoral systems.

[BibT_eX]

[DOI]

Networks, 2012

Range minimization problems in path-facility location on trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Minimax regret path location on trees.

[BibT_eX]

[DOI]

Networks, 2011

Locating median paths on connected outerplanar graphs.

[BibT_eX]

[DOI]

Networks, 2011

The give-up problem for blocked regional lists with multi-winners.

[BibT_eX]

[DOI]

Bruno Simeone

Math. Soc. Sci., 2011

Political districting: from classical models to recent approaches.

[BibT_eX]

[DOI]

Bruno Simeone

4OR, 2011

2009

The continuous and discrete path-variance problems on trees.

[BibT_eX]

[DOI]

Networks, 2009

On the complexity of some subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Extensive facility location problems on networks with equity measures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On the Complexity of Graph-Based Bounds for the Probability Bounding Problem.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Weighted Voronoi region algorithms for political districting.

[BibT_eX]

[DOI]

Bruno Simeone

Math. Comput. Model., 2008

Comparing different metaheuristic approaches for the median path problem with bounded length.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

A clique algorithm for standard quadratic programming.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

A Novel Method Based on Voltammetry for the Qualitative Analysis of Water.

[BibT_eX]

[DOI]

Nicola Acito

Giovanni Corsini

IEEE Trans. Instrum. Meas., 2007

Algorithms for central-median paths with bounded length on trees.

[BibT_eX]

[DOI]

Ronald I. Becker

Eur. J. Oper. Res., 2007

The location of median paths on grid graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2005

On finding dissimilar Pareto-optimal paths.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Monica Gentili

Eur. J. Oper. Res., 2005

2002

Efficient algorithms for finding the (k, l)-core of tree networks.

[BibT_eX]

[DOI]

Networks, 2002

Finding the l-core of a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

The Forest Wrapping Problem on Outerplanar Graphs.

[BibT_eX]

[DOI]