Zobrazeno 1 - 10
of 5 589
pro vyhledávání: '"Lucà E"'
Publikováno v:
Il Foro Italiano, 2015 Nov 01. 138(11), 609/610-613/614.
Externí odkaz:
https://www.jstor.org/stable/44880654
Autor:
Mores, Francesco
Publikováno v:
Studi Storici, 2015 Apr 01. 56(2), 287-310.
Externí odkaz:
http://www.jstor.org/stable/43932822
Publikováno v:
Il Foro Italiano, 2010 Oct 01. 133(10), 503/504-511/512.
Externí odkaz:
https://www.jstor.org/stable/23207278
Autor:
Monti, Martino Rossi
Publikováno v:
Bruniana & Campanelliana, 2009 Jan 01. 15(2), 423-443.
Externí odkaz:
https://www.jstor.org/stable/24336754
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for each paramet
Externí odkaz:
http://arxiv.org/abs/2310.05147
Autor:
Pier Luigi Porzio, Pio Baldi
Questa è la seconda pubblicazione dell'Accademia di San Luca con il sottotitolo: APERTI PER RESTAURI. Tale locuzione diventa quindi un tracciato di metodo per le manutenzioni e gli interventi che l'Accademia effettua sulle opere d'arte e sugli edifi
In p-median location interdiction the aim is to find a subset of edges in a graph, such that the objective value of the p-median problem in the same graph without the selected edges is as large as possible. We prove that this problem is NP-hard even
Externí odkaz:
http://arxiv.org/abs/2301.13723
The minimum cost flow problem is one of the most studied network optimization problems and appears in numerous applications. Some efficient algorithms exist for this problem, which are freely available in the form of libraries or software packages. I
Externí odkaz:
http://arxiv.org/abs/2210.02195
Autor:
Delcorno, Carlo
Publikováno v:
Lettere Italiane, 1995 Jan 01. 47(1), 47-63.
Externí odkaz:
https://www.jstor.org/stable/26265736
Autor:
Isnenghi, Mario
Publikováno v:
Belfagor, 1986 May . 41(3), 318-322.
Externí odkaz:
https://www.jstor.org/stable/26145563