Results 181 to 190 of about 2,971,508 (208)

Efficient heuristics for the Steiner forest problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger   +4 more
wiley   +1 more source

Minimizing cutting costs in 1D rod cutting

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We study a one‐dimensional rod‐cutting problem arising from an industrial setting where cutting itself carries cost. Each order specifies a length interval, and the task is to assign orders to warehouse rods so that all orders are satisfied while the number of cuts is minimized.
Bowen Li, Attila Sali
wiley   +1 more source

Ramanujan expander networks for authenticated grayscale image encryption. [PDF]

open access: yesPLoS One
Razzaque A   +4 more
europepmc   +1 more source

Chromatic Polynomials of Signed Graphs and Dominating-Vertex Deletion Formulae [PDF]

open access: yesJournal of Graph Theory
We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky.
Jeven Syatriadi, Gary Greaves
exaly   +4 more sources

Home - About - Disclaimer - Privacy