Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In recent years, the usage of drones in last‐mile logistics has stirred great interest in the operations research community. Many papers have considered schemes of hybrid truck‐and‐drone delivery. In this paper, we focus on the Multivisit Drone Routing Problem with Edge Launches (MVDRP‐EL) which assumes: a heterogenous set of packages, a drone capable of carrying multiple packages at a time and that...
We consider two new problems regarding the impact of edge addition or removal on the modularity of partitions (or community structures) in a network. The first problem seeks to add edges to enforce that a desired partition is one partition that maximizes modularity. The second problem seeks to find the sparsest representation of a network that has the same partition with maximum modularity as the...
We consider the number of paths that must pass through a subset X of vertices of a capacitated network N in a maximum sequence of arc‐disjoint paths connecting two vertices y and z. We consider then the difference between the maximum flow value from y to z in N and the maximum flow value from y to z in the network obtained from N by setting to zero the capacities of arcs incident to X. When X is a...
We study the relation between the linear programming relaxation of two classes of models for the Steiner tree problem with hop constraints. One class is characterized by having hop‐indexed arc variables. Although such models have proved to have a very strong linear programming bound, they are not easy to use because of the huge number of variables. This has motivated some studies with models involving...
Let denote the distance matrix of n objects, and let T be an unrooted binary tree in which the leaves denote those n objects. We want to find such a tree with the constraint that the edge weights are nonnegative where the distances between the leaves best estimate their corresponding values in D. Accordingly, we have adopted the residual sum of squares (RSS) criterion to minimize the discrepancy...
Given its wide spectrum of applications, the classical problem of all‐terminal network reliability evaluation remains a highly relevant problem in network design. The associated optimization problem—to find a network with the best possible reliability under multiple constraints—presents an even more complex challenge, which has been addressed in the scientific literature but usually under strong assumptions...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.