1,721,219 research outputs found
Il futuro della canapa italiana passa dal settore alimentare
No full textLa rinnovata attrattiva verso la coltivazione della canapa è determinata da molteplici possibilità d’impiego di questa pianta e dalla crescente domanda da parte del consumatore di prodotti ecocompatibili e sostenibili. Da questa coltura si possono ottenere prodotti alimentari, tessili, cosmetici, bioedili e di interesse zootecnico.
Prospettive interessanti per la canapa arrivano dal settore alimentare: le trasformazioni del seme infatti non necessitano di nuovi impianti di lavorazione, ma utilizzano frantoi per semi oleaginosi e mulini per farine già presenti in tutta Italia
A rollout metaheuristic for job shop scheduling problems
No full textIn this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we report on an extensive study on the applicability of a metaheuristic approach, called rollout or pilot method. Its basic idea is a look-ahead strategy, guided by one or more subheuristics, called pilot heuristics. Our results indicate that this method is competitive and very promising for solving complex scheduling problems
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
No full textGiven a graph G = (V; E);HCN(L(G)) is the minimum number of edges to be added to its line graph L(G) to make L(G) Hamiltonian. This problem is known to be NP-hard for general
graphs, whereas a O(|V|) algorithm exists when G is a tree. In this paper a linear algorithm for
finding HCN(L(G)) when G is a cactus is proposed
- …
