#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1982

2018

- This year (4)
- Last 5 years (15)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia
- INFORMS Journal on Computing
- 2006

- Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo
- SIAM Journal on Optimization
- 2004

We describe an extension of the classical cutting plane algorithm to tackle the unconstrained minimization of a nonconvex, not necessarily differentiable function of several variables. The method is based on the construction of both a lower and an upper polyhedral approximation to the objective function and it is related to the use of the concept of… (More)

- Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia
- European Journal of Operational Research
- 2007

The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container rehandling operations inside the yard. This study of the SAP was undertaken for the Gioia Tauro port which is located in Italy and is the main hub terminal for container traffic… (More)

- Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili
- Comp. Opt. and Appl.
- 2013

We study a variant of the spanning tree problem where we require that, for a given connected graph, the spanning tree to be found has the minimum number of branch vertices (that is vertices of the tree whose degree is greater than two). We provide four different formulations of the problem and compare different relaxations of them, namely lagrangian… (More)

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel, in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained… (More)

- Annabella Astorino, Manlio Gaudioso
- Comput. Manag. Science
- 2009

We consider a special case of the optimal separation, via a sphere, of two discrete point sets in a finite dimensional Euclidean space. In fact we assume that the center of the sphere is fixed. In this case the problem reduces to the minimization of a convex and nonsmooth function of just one variable, which can be solved bymeans of an “ad hoc” method inO(p… (More)

- Manlio Gaudioso, Giuseppe Paletta
- Transportation Science
- 1992

- Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico
- Math. Oper. Res.
- 2006

- Renato De Leone, Manlio Gaudioso, Luigi Grippo
- Math. Program.
- 1984

- Annabella Astorino, Antonio Fuduli, Manlio Gaudioso
- J. Global Optimization
- 2010

We propose two different approaches for spherical separation of two sets. Both methods are based on minimizing appropriate nonconvex nondifferentiable error functions, which can be both expressed in a DC (Difference of two Convex) form. We tackle the problem by adopting the DC-Algorithm. Some numerical results on classical binary datasets are reported.