Results 61 to 70 of about 10,050 (224)
Networks, Volume 86, Issue 4, Page 361-388, December 2025.ABSTRACT The Split Delivery Vehicle Routing Problem with Two‐dimensional Loading Constraints (2L‐SDVRP) integrates vehicle routing, split delivery, and two‐dimensional packing constraints. In the 2L‐SDVRP, customers can be served by multiple vehicles, and their demands consist of different two‐dimensional rectangular items that must be packed in the ...
Kamyla Maria Ferreira +4 more
wiley +1 more source
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
, 2016 We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges.
Abraham, Ittai +2 more
core +1 more source
The Metric Nearness Problem [PDF]
, 2008 Metric nearness refers to the problem of optimally restoring metric properties to distance measurements that happen to be nonmetric due to measurement errors or otherwise.
Brickell, Justin +3 more
core
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
, 2016 The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. "$\parallel$" (parallel) and "$;$" (serial), are insufficient in expressing "partial dependencies" or "partial ...
Dinh, David +2 more
core +1 more source
Multi-Topology Routing Algorithms in SDN-Based Space Information Networks
Future Internet, 2019 Aiming at the complex structure of the space information networks (SIN) and the dynamic change of network topology, in order to design an efficient routing strategy, this paper establishes a SIN management architecture based on Software-defined ...
Xiangli Meng, Lingda Wu, Shaobo Yu
doaj +1 more source
Energy Conversion and Economics, 2023 With the continuously increasing penetration of electric vehicles (EVs), the mutual match between the distribution of charging resources and the spatial–temporal distribution of EV charging demands is becoming increasingly important.
Chenlin Ji +6 more
doaj +1 more source
Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm
, 2021 The Floyd-Warshall algorithm is the most popular algorithm for determining the shortest paths between all pairs in a graph. It is very a simple and an elegant algorithm. However, if the graph does not contain any negative weighted edge, using Dijkstra's shortest path algorithm for every vertex as a source vertex to produce all pairs shortest paths of ...
openaire +2 more sources
Software: Practice and Experience, Volume 55, Issue 10, Page 1657-1675, October 2025.ABSTRACT Background Low Earth Orbit (LEO) satellite constellations are redefining the concept of global connectivity, opening up a new world of opportunities for communication services and applications. Purpose The emergence of LEO satellites (SATs) is ushering in a new era of innovation, where new complex technologies are being developed, and the use ...
Pilar Manzanares‐Lopez +2 more
wiley +1 more source
Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential [PDF]
, 2013 Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak processing rate to memory bandwidth) as highlighted by recent studies on Exascale architectural trends.
Elango, Venmugil +7 more
core +2 more sources
Identifying the Shortest Path of a Semidirected Graph and Its Application
Mathematics, 2022 The basic goal of this research is to find the shortest path of a semidirected graph and apply it to the road network system. In the field of graph theory, networks are described as directed graphs, undirected graphs, or a combination of both.
Rakhi Das +4 more
doaj +1 more source