Most vital vertices for the shortest s–t path problem: complexity and Branch-and-Cut algorithm
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01527-5
Abstract: In this paper we study the most vital vertices for the shortest s–t path problem. This problem consists, given a digraph $$D=(V\cup \{s,t\},A)$$D=(V∪{s,t},A) and a threshold $$d\in \mathbb {N}$$d∈N, in finding the minimum number of… read more here.
Keywords: vital vertices; vertices shortest; path problem; shortest path ... See more keywords
Approximation algorithms for the k-depots Hamiltonian path problem
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Letters"
DOI: 10.1007/s11590-021-01774-5
Abstract: We consider a multiple-depots extension of the classic Hamiltonian path problem where k salesmen are initially located at different depots. To the best of our knowledge, no algorithm for this problem with a constant approximation… read more here.
Keywords: approximation; hamiltonian path; path problem; approximation ratio ... See more keywords
An extension principle based solution approach for shortest path problem with fuzzy arc lengths
Sign Up to like & getrecommendations! Published in 2017 at "Operational Research"
DOI: 10.1007/s12351-016-0230-4
Abstract: AbstractA shortest path problem on a network in the presence of fuzzy arc lengths is focused in this paper. The aim is to introduce the shortest path connecting the first and last vertices of the… read more here.
Keywords: arc lengths; fuzzy; path problem; path ... See more keywords
A Retroactive Approach for Dynamic Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0674-6
Abstract: AbstractDynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration. In the premise of this paper, the dynamic Dijkstra algorithm is specifically considered which… read more here.
Keywords: retroactive approach; approach dynamic; path problem; path ... See more keywords
General Model of Tool Path Problem for the CNC Sheet Cutting Machines
Sign Up to like & getrecommendations! Published in 2019 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2019.11.609
Abstract: Abstract The formalization of the tool path problem for the CNC sheet metal/material cutting equipment is considered. General model of tool path problem for laser/plasma/gas/water-jet machines is offered. Model uses the term “the basic cutting… read more here.
Keywords: tool path; model; path problem; problem ... See more keywords
Nanopore decoding for a Hamiltonian path problem.
Sign Up to like & getrecommendations! Published in 2021 at "Nanoscale"
DOI: 10.1039/d0nr09031j
Abstract: DNA computing has attracted attention as a tool for solving mathematical problems due to the potential for massive parallelism with low energy consumption. However, decoding the output information to a human-recognizable signal is generally time-consuming… read more here.
Keywords: nanopore decoding; hamiltonian path; path problem; dna ... See more keywords
Solution Algorithms for the Bounded Acceleration Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2022.3172169
Abstract: The purpose of this article is to introduce and characterize the bounded acceleration shortest path problem (BASP), a generalization of the shortest path problem (SP). This problem is associated to a graph: nodes represent positions… read more here.
Keywords: problem; path problem; path; shortest path ... See more keywords
Pilot Assisted Adaptive Thresholding for Sneak-Path Mitigation in Resistive Memories With Failed Selection Devices
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2019.2948332
Abstract: Resistive random-access memory (ReRAM) with the crossbar structure is one promising candidate to be used as a next generation non-volatile memory device. In a crossbar ReRAM, in which a memristor is positioned on each row-column… read more here.
Keywords: sneak path; selection devices; pilot; path ... See more keywords
An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2021 at "Informs Journal on Computing"
DOI: 10.1287/ijoc.2021.1081
Abstract: This paper proposes an exact algorithm to solve the one-to-one multiobjective shortest path problem. The solution involves determining a set of nondominated paths between two given nodes in a graph... read more here.
Keywords: path problem; efficient label; shortest path; multiobjective shortest ... See more keywords