Results 131 to 140 of about 749,587 (350)
Constrained shortest paths and related problems
, 2001 The classical shortest path problem, to find a path of minimal cost between two nodes in a graph, is efficiently solvable in polynomial time. However, in many applications we also have additional budget or resource constraints on a path. This problem is known as constrained shortest path problem and unfortunately belongs to the class of "hard" problems
openaire +3 more sources
Link distance and shortest path problems in the plane
Computational Geometry, 2009 AbstractThis paper describes algorithms to compute Voronoi diagrams, shortest path maps, the Hausdorff distance, and the Fréchet distance in the plane with polygonal obstacles. The underlying distance measures for these algorithms are either shortest path distances or link distances.
Atlas F. Cook, Carola Wenk
openaire +5 more sources
Developing Cathode Films for Practical All‐Solid‐State Lithium‐Sulfur Batteries
Advanced Materials, EarlyView.The development of all‐solid‐state lithium‐sulfur batteries offers higher specific energies and lower costs compared to state‐of‐the‐art Li‐ion batteries. However, a lack of mechanistic understanding hinders advancement. This review analyzes key electrode parameters, evaluates progress in enhancing ion/electron percolation, and addresses ...
Chao Ye +4 more
wiley +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
, 1991 Dimitri P. Bertsekas, John N. Tsitsiklis
openalex +1 more source
Advanced Materials, EarlyView.In this review, the recent development of deep‐blue (≤465 nm) perovskite light‐emitting diodes (PeLEDs) are summarized, using different perovskite nanomaterials, including nanocrystals (NCs), quantum dots (QDs), nanoplatelets (NPLs), quasi‐2D thin film, 3D bulk thin film, as well as lead‐free perovskite nanomaterials.
Pui Kei Ko +6 more
wiley +1 more source
Robust time-varying shortest path with arbitrary waiting time at vertices
Croatian Operational Research Review, 2017 In this paper, we propose an algorithm for solving the robust time varying shortest path problem in which the waiting time at any vertex is not restricted. The problem is to find the shortest path connecting source node s and sink node i in a timevarying
Gholamhassan Shirdel, Hassan Rezapour
doaj +1 more source
A parallel shortest augmenting path algorithm for the assignment problem [PDF]
, 1991 Egon Balas +3 more
openalex +1 more source
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
A Bio‐Inspired Perspective on Materials Sustainability
Advanced Materials, EarlyView.This perspective discusses natural materials as inspiration for sustainable engineering designs and the processing of materials. First, circularity, longevity, parsimony, and activity are presented as essential material paradigms. The perspective then uses many examples of natural and technical materials to introduce principles such as oligo ...
Wolfgang Wagermaier +2 more
wiley +1 more source
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets [PDF]
Journal of Optimization in Industrial Engineering, 2013 A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced
Sadollah Ebrahimnejad +2 more
doaj