Andrea Grosso

发表

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Marco Di Summa, Bernardetta Addis, Andrea Grosso, 2013, Discret. Appl. Math..

An experimental analysis of a population based approach for global optimization

Andrea Grosso, Fabio Schoen, Marco Locatelli, 2007, Comput. Optim. Appl..

A GPI dynasearch neighborhood for the total weighted tardiness problem

Roberto Tadei, Federico Della Croce, Andrea Grosso, 2002 .

A single machine scheduling problem with two-dimensional vector packing constraints

Jean-Charles Billaut, Federico Della Croce, Andrea Grosso, 2015, Eur. J. Oper. Res..

Far field localization using two transducers: a "virtual array" approach

Andrea Grosso, Jelmer Wind, Keith Holland, 2011 .

Operational Transfer Path Analysis: Interpretation and Understanding of the Measurement Results Using Response Modification Analysis (RMA).

Andrea Grosso, Martin Lohrmann, 2016 .

Modelling and Optimization of Cross-Media Production Processes

Pietro Piazzolla, Marco Gribaudo, Alberto Messina, 2010, OR.

Algorithmic paradoxes of the single‐machine total tardiness problem

Wlodzimierz Szwarc, Federico Della Croce, Andrea Grosso, 2001 .

A matheuristic approach for the two-machine total completion time flow shop problem

Federico Della Croce, Andrea Grosso, Fabio Salassa, 2014, Ann. Oper. Res..

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Roberto Aringhieri, Andrea Grosso, Rosario Scatamacchia, 2018, Discret. Appl. Math..

A heuristic approach for the max-min diversity problem based on max-clique

Federico Della Croce, Andrea Grosso, Marco Locatelli, 2009, Comput. Oper. Res..

A “maximum node clustering” problem

Federico Della Croce, Andrea Grosso, Marco Locatelli, 2006, J. Comb. Optim..

Searching for a cycle with maximum coverage in undirected graphs

Andrea Grosso, Wim Vancroonenburg, Fabio Salassa, 2016, Optim. Lett..

Solution of the single machine total tardiness problem

Wlodzimierz Szwarc, Federico Della Croce, Andrea Grosso, 1999 .

A Genetic Algorithm for a class of Critical Node Problems

Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, 2016, Electron. Notes Discret. Math..

Loudspeaker cabinet characterization using a particle-velocity based scanning method

Andrea Grosso, Keith Holland, Daniel Fernandez Comesana, 2013 .

VNS solutions for the Critical Node Problem

Roberto Aringhieri, Andrea Grosso, Rosario Scatamacchia, 2015, Electron. Notes Discret. Math..

A rolling horizon framework for the OR planning under uncertain surgery duration: deterministic versus robust approach

Bernardetta Addis, Andrea Grosso, Giuliana Carello, 2014 .

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Federico Della Croce, Andrea Grosso, Thierry Garaix, 2012, Comput. Oper. Res..

Complexity of the critical node problem over trees

Marco Di Summa, Andrea Grosso, Marco Locatelli, 2011, Comput. Oper. Res..

Design of Logical Topologies in Wavelength-Routed IP Networks*

Marco Ajmone Marsan, Marco Mellia, Emilio Leonardi, 2002, Photonic Network Communications.

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

Federico Della Croce, Andrea Grosso, Marco Locatelli, 2004, J. Heuristics.

Neural networks for wind power generation forecasting: A case study

Andrea Grosso, Rossella Cancelliere, Alberto Gosso, 2013, 2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC).

Computational Experience with Pseudoinversion-Based Training of Neural Networks Using Random Projection Matrices

Patrick Gallinari, Andrea Grosso, Rossella Cancelliere, 2014, AIMSA.

A preliminary analysis of the Distance Based Critical Node Problem

Roberto Aringhieri, Andrea Grosso, Rosario Scatamacchia, 2016, Electron. Notes Discret. Math..

A rolling horizon framework for the operating rooms planning under uncertain surgery duration

Bernardetta Addis, Andrea Grosso, Giuliana Carello, 2014 .

Solving the problem of packing equal and unequal circles in a circular container

Andrea Grosso, Fabio Schoen, Marco Locatelli, 2010, J. Glob. Optim..

Performance of P-P and P-U intensity probes using Scan & Paint

Andrea Grosso, Jelmer Wind, Keith Holland, 2011 .

Case studies of Matheuristics applications to combinatorial optimization problems

Andrea Grosso, Fabio Guido Mario Salassa, Federico Della Croce Di Dojola, 2011 .

Matheuristics: embedding MILP solvers into heuristic algorithms for combinatorial optimization problems

F. Della Croce, Andrea Grosso, Fabio Guido Mario Salassa, 2013 .

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

Federico Della Croce, Andrea Grosso, Fabio Salassa, 2011, EvoCOP.

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Federico Della Croce, Andrea Grosso, 2012, Comput. Oper. Res..

Further Development of Velocity-based Airborne TPA: Scan & Paint TPA as a Fast Tool for Sound Source Ranking

Andrea Grosso, Jelmer Wind, Keith Holland, 2012 .

Optimal facility location with random throughput costs

Roberto Tadei, Andrea Grosso, Nicoletta Ricciardi, 2002, Comput. Oper. Res..

A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures

Andrea Grosso, Fabio Schoen, Marco Locatelli, 2007, Math. Program..

Particle velocity sensors for enhancing vehicle simulations

Andrea Grosso, Daniel Fernandez Comesana, Iban Cereijo Grana, 2013 .

A general Evolutionary Framework for different classes of Critical Node Problems

Roberto Aringhieri, Andrea Grosso, Rosario Scatamacchia, 2016, Eng. Appl. Artif. Intell..

A Matheuristic Approach for the Total Completion Time Permutation Flow Shop Problem

Andrea Grosso, Fabio Guido Mario Salassa, Federico Della Croce Di Dojola, 2010 .

Finding maximin latin hypercube designs by Iterated Local Search heuristics

Andrea Grosso, Marco Locatelli, A. R. M. J. U. Jamali, 2009, Eur. J. Oper. Res..

Simple ingredients leading to very efficient heuristics for the maximum clique problem

Wayne J. Pullan, Andrea Grosso, Marco Locatelli, 2008, J. Heuristics.

Solving molecular distance geometry problems by global optimization algorithms

Andrea Grosso, Fabio Schoen, Marco Locatelli, 2009, Comput. Optim. Appl..

Computational experience with a core-based reduction procedure for the 2-knapsack problem

Federico Della Croce, Andrea Grosso, 2011, Comput. Oper. Res..

Fast Panel Noise Contribution Analysis on a Running Train

Andrea Grosso, Wilfred Hake, 2010 .

Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic

Marco Ajmone Marsan, Marco Mellia, Emilio Leonardi, 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

Assessing vehicle exterior noise using a virtual phased array (VPA)

Andrea Grosso, Keith Holland, Daniel Fernandez Comesana, 2013 .

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Vangelis Th. Paschos, Federico Della Croce, Andrea Grosso, 2004, J. Sched..

Further Development of the PNCA: New Panel Noise Contribution Reference-Related (PNCAR)

Andrea Grosso, Daniel Fernandez Comesana, Hans-Elias de Bree, 2012 .

Hybrid constructive heuristics for the critical node problem

Roberto Aringhieri, Bernardetta Addis, Andrea Grosso, 2016, Annals of Operations Research.

Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties

Marco Mellia, Emilio Leonardi, Antonio Nucci, 2001, IEEE Communications Letters.

Local search and pseudoinversion: an hybrid approach to neural network training

Patrick Gallinari, Andrea Grosso, Rossella Cancelliere, 2016, Knowledge and Information Systems.

Branch and cut algorithms for detecting critical nodes in undirected graphs

Marco Di Summa, Andrea Grosso, Marco Locatelli, 2012, Computational Optimization and Applications.

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem

Federico Della Croce, Andrea Grosso, Fabio Salassa, 2019, J. Heuristics.

Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine

Andrea Grosso, Alessandro Druetto, 2022, Comput. Oper. Res..

Handling uncertainty in health care management using the cardinality-constrained approach: Advantages and remarks

Bernardetta Addis, Andrea Grosso, Giuliana Carello, 2015 .

Iterated Local Search Approaches to Maximin Latin Hypercube Designs

Andrea Grosso, Marco Locatelli, M. Locatelli, 2008 .

Simplex Algorithms for Linear Programming

Andrea Grosso, Frédérico Della Croce, 2013 .

Workforce management based on forecasted demand

Francesco Maffioli, Roberto Aringhieri, Bernardetta Addis, 2012 .