Andrea Cesare Grosso | Università degli Studi di Torino (original) (raw)

Papers by Andrea Cesare Grosso

Computers & Operations Research, 2002

... a Dept. di Statistica, University “La Sapienza”, Rome, Piazzale Aldo Moro 5, 00185 Roma, Ital... more ... a Dept. di Statistica, University “La Sapienza”, Rome, Piazzale Aldo Moro 5, 00185 Roma, Italy. ... The multinomial Logit model was proposed as a theory of choice behavior by Luce [14]. Its econometric analysis has been investigated by McFadden [15] and Nerlove and Press [16]. ...

Based on the work by Congram, Potts and Van de Velde (1), we develop a dynasearch neighborhood ba... more Based on the work by Congram, Potts and Van de Velde (1), we develop a dynasearch neighborhood based on the Generalized Pairwise Interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of (1).

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001

Operations Research for Health Care, 2015

ABSTRACT Different approaches have been proposed in the literature to handle uncertain parameters... more 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.

Electronic Notes in Discrete Mathematics, 2015

We present a VNS algorithm for the Critical Node Problem, i.e., the maximal fragmentation of a gr... more We present a VNS algorithm for the Critical Node Problem, i.e., the maximal fragmentation of a graph through the deletion of k nodes. Two computational efficient neighbourhoods are proposed proving also their equivalence to the straightforward exchange of two nodes. The results of the proposed VNS algorithms outperform those currently available in literature.

Lecture Notes in Computer Science, 2011

This paper deals with the total completion time 2-machines flow shop problem. We present a so-cal... more This paper deals with the total completion time 2-machines flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n 2) variables and O(n) constraints.

European Journal of Operational Research, 2015

ABSTRACT We consider a scheduling problem where jobs consume a perishable resource stored in vial... more ABSTRACT We consider a scheduling problem where jobs consume a perishable resource stored in vials. It leads to a new scheduling problem, with two-dimensional jobs, one dimension for the duration and one dimension for the consumption. Jobs have to be finished before a given due date, and the objective is to schedule the jobs on a single machine so that the maximum lateness does not exceed a given threshold and the number of vials required for processing all the jobs is minimized. We propose a two-step approach embedding a Recovering Beam Search algorithm to get a good-quality initial solution reachable in short time and a more time consuming matheuristic algorithm. Computational experiments are performed on the benchmark instances available for the two-dimensional vector packing problem integrated with additional due dates to take into account the maximum lateness constraints. The computational results show very good performances of the proposed approach that remains effective also on the original two-dimensional vector packing instances without due dates where 7 new bounds are obtained.

Photonic Network Communications, 2002

2009 12th International Conference on Computers and Information Technology, 2009

Proceedings of2009 12th International Conference on Computer and Information Technology (ICCIT 20... more Proceedings of2009 12th International Conference on Computer and Information Technology (ICCIT 2009) 21-23 December, 2009, Dhaka, Bangladesh ... Packing Identical Circles in a Minimized Circular Container by ... ARM Jalal Uddin Jamali, A. Grosso*, M. Locatelli*, F. Schoent ...

Operations Research Letters, 2004

Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total wei... more Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results signiÿcantly improve over those of Congram, Potts and Van de Velde.

Mathematical Programming, 2007

When dealing with extremely hard global optimization problems, i.e. problems with a large number ... more When dealing with extremely hard global optimization problems, i.e. problems with a large number of variables and a huge number of local optima, heuristic procedures are the only possible choice. In this situation, lacking any possibility of guaranteeing global optimality for most problem instances, it is quite difficult to establish rules for discriminating among different algorithms. We think that in order to judge the quality of new global optimization methods, different criteria might be adopted like, e.g.:

Journal of Scheduling, 2001

... di = max(Ei;di), for i =1;:::;n are modified due dates where Ei are found by a procedure of R... more ... di = max(Ei;di), for i =1;:::;n are modified due dates where Ei are found by a procedure of Reference [1]. di model and dimodel symbolize the tardiness problem with due dates di ... If n=[s] then {s; s+1;:::;n} is the list of possible positions of job n. Decomposition II (Della Croce et al. ...

Journal of Scheduling, 1999

The paper deals with the solution of the single machine total tardiness model. It improves and ge... more The paper deals with the solution of the single machine total tardiness model. It improves and generalizes an important rule to decompose the model into two subproblems. It also provides a O(n) procedure to implement this rule and its generalization. Those two rules, along with some known results, are incorporated in a branch and bound algorithm that efficiently handles instances with up to 300 jobs and uses the original and maximally increased due dates to solve the original problem. Several properties that justify the modified due date version of our algorithm and produce an easy-to-implement new lower bound are established. The paper also provides an explanation why using the increased due dates may improve the efficiency of certain algorithms.

Journal of Scheduling, 2010

We consider the problem of minimizing the weighted number of tardy jobs on a single machine where... more We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure, that allows to solve to optimality instances with up to 30,000 jobs in size and up to 50,000 jobs in size for the special deadline-free case.

Journal of Heuristics, 2008

Journal of Heuristics, 2000

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic gre... more In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.

Journal of Global Optimization, 2010

In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Popu... more In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles within a circular container with minimum radius. Extensive computational experiments have been performed both to analyze the problem at hand, and to choose in an appropriate way the parameter values for the proposed methods. Different improvements with respect to the best results reported in the literature have been detected.

Journal of Combinatorial Optimization, 2006

In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that t... more In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that the problem is stronglyNP-complete and show that it can be approximated in polynomial time within a ratio arbitrarily close to 2. For the special case where the graph is a tree, we prove that the problem is weakly NP-complete as it generalizes the 0/1 Knapsack problem and is solvable in pseudopolynomial time by a dynamic programming approach. For this latter case an FPTAS is also presented.

IEEE Communications Letters, 2000