1,720,993 research outputs found
A Dual Ascent Approach to the Bounded-Degree Spanning Tree Problem
No full textGiven a connected graph G a vertex is said to be of the branch type if its
degree is greater than 2. We consider the problem of nding a spanning
tree of G which minimizes the number of branch vertices. Such a problem
has been proved to be NP-complete, and some efcient heuristics
to solve it have been proposed in the literature. In the paper we present
a new heuristic algorithm based on solving the Lagrangean dual of the
original mixed integer programming problem by means of a dual ascent
procedure requiring update of one multiplier at a time
Stopping Criteria for Linesearch Methods without Derivatives
No full textIn this paper acceptability criteria for the linesearch stepsize are introduced which require only function values. Simple algorithm models based on these criteria are presented. Some modifications of criteria based on the knowledge of the directional derivative are also illustrated
Improving Social Assistance Services for Minors and Disabled People by Using Multiobjective Programming
No full textSemi-automatic approaches and tools for the extraction and the exploitation of intentional knowledge from heterogeneous information sources
No full textDottorato di ricerca in ingegneria dei sistemi ed informatica. 12. ciclo. A. a. 1998-99. Coordinatore Manlio Gaudioso. Tutore Domenico Sacca'Consiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome; Biblioteca Nazionale Centrale - P.za Cavalleggeri, 1, Florence / CNR - Consiglio Nazionale delle RichercheSIGLEITItal
La classificazione di testi: metodi, modelli e strumenti per la linguistica computazionale
No full textDottorato di ricerca in ingegneria dei sistemi ed informatica. 12. ciclo. A.a. 1998-99. Coordinatore Manlio Gaudioso. Tutore Alfredo EisinbergConsiglio Nazionale delle Ricerche - Biblioteca Centrale - P.le Aldo Moro, 7, Rome; Biblioteca Nazionale Centrale - P.za Cavalleggeri, 1, Florence / CNR - Consiglio Nazionale delle RichercheSIGLEITItal
Nonsmooth optimization: Theory and algorithms
No full textThis is a summary of the author's PhD thesis supervised by Manlio Gaudioso and Maria Flavia Monaco and defended on 21 February 2008 at the Università della Calabria. The thesis is a survey on nonsmooth optimization methods for both convex and nonconvex functions. The main contribution of the dissertation is the presentation of a new bundle type method. The thesis is written in English and is available from http://www2.deis.unical.it/logilab/gorgone. © 2009 Springer-Verlag
An Algorithm for Convex NDO Based on Properties of the Contour Lines of Convex Quadratic Functions
No full text
- …
