#### Filter Results:

#### Publication Year

1983

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- PANOS M. PARDALOS, H. EDWIN ROMEIJN, Hanif D. Sherali, Mohit Tawarmalani, Nikolaos V. Sahinidis, Walter Murray +18 others
- 2001

- Fabio Schoen
- J. Global Optimization
- 1991

- Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli, Fabio Schoen
- J. Global Optimization
- 2010

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… (More)

- Marco Locatelli, Fabio Schoen
- Math. Program.
- 1999

- Bernardetta Addis, Marco Locatelli, Fabio Schoen
- Oper. Res. Lett.
- 2008

- Francesco Rinaldi, Fabio Schoen, Marco Sciandrone
- Comp. Opt. and Appl.
- 2010

Given a non empty polyhedral set, we consider the problem of finding a vector belonging to it and having the minimum number of nonzero components, i.e., a feasible vector with minimum zero-norm. This nonsmooth combinatorial optimization problem is NP-Hard and arises in various fields such as machine learning, pattern recognition, signal processing. We… (More)

- Andrea Grosso, Marco Locatelli, Fabio Schoen
- Comp. Opt. and Appl.
- 2009

In this paper we consider global optimization algorithms based on multiple local searches for the Molecular Distance Geometry Problem (MDGP). Three distinct approaches (Multistart, Monotonic Bain Hopping, Population Basin Hopping) are presented and for each of them a computational analysis is performed. The results are also compared with those of two other… (More)

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

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… (More)

- Bernardetta Addis, Marco Locatelli, Fabio Schoen
- INFORMS Journal on Computing
- 2008

We present a new computational approach to the problem of placing n identical non overlapping disks in the unit square in such a way that their radius is maximized. The problem has been studied in a large number of papers, both from a theoretical and from a computational point of view. In this paper we conjecture that the problem possesses a so-called… (More)

- Jonathan P. K. Doye, Robert H. Leary, Marco Locatelli, Fabio Schoen
- INFORMS Journal on Computing
- 2004

The Morse potential is a simple model pair potential that has a single parameter ρ which determines the width of the potential well and allows a wide variety of materials to be modelled. Morse clusters provide a particularly tough test system for global optimization algorithms, and one that is highly relevant to methods that are to be applied to find the… (More)