The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.