Efficient acceleration of the convergence of the minimum free energy path via a path‐planning generated initial guess
Sign Up to like & getrecommendations! Published in 2024 at "Journal of Computational Chemistry"
DOI: 10.1002/jcc.27504
Abstract: We demonstrate that combining a shifted clustering algorithm with a fast‐marching‐based algorithm can generate accurate approximations of the minimum energy path (MEP) given a free energy landscape (FEL). Using this approximation as the initial guess… read more here.
Keywords: free energy; initial guess; energy path; path ... See more keywords
A dual-path psychosocial model of social determinants of health in the community: Results from the Cause Commune program.
Sign Up to like & getrecommendations! Published in 2022 at "Journal of community psychology"
DOI: 10.1002/jcop.22952
Abstract: We tested a dual-path psychosocial framework of social vulnerability that considers the impact of socioeconomic resources and cognitive social capital on health, and whether they were mediated by an enabling psychosocial path (collective efficacy) and… read more here.
Keywords: health; path; community; dual path ... See more keywords
Automatic segmentation of high-risk clinical target volume for tandem-and-ovoids brachytherapy patients using an asymmetric dual-path convolutional neural network.
Sign Up to like & getrecommendations! Published in 2022 at "Medical physics"
DOI: 10.1002/mp.15490
Abstract: PURPOSES Pre-implant diagnostic MRI is the gold standard for image-guided tandem-and-ovoids brachytherapy for cervical cancer. However, high dose rate (HDR) brachytherapy planning is typically done on post-implant CT-based high-risk clinical target volume (HR-CTVCT ) because… read more here.
Keywords: pre implant; tandem ovoids; path; dual path ... See more keywords
Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21778
Abstract: A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures… read more here.
Keywords: node disjoint; heuristics determining; disjoint path; efficient heuristics ... See more keywords
Open shortest path first routing under random early detection
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21792
Abstract: In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we… read more here.
Keywords: open shortest; early detection; path first; shortest path ... See more keywords
Capacity provisioning for evacuation on path networks
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22118
Abstract: Designing an appropriate evacuation plan in the event of large scale disasters is extremely important. A considerable research effort has been invested in effective mathematical models and algorithms for the evacuation of densely populated areas.… read more here.
Keywords: network; capacity; sink; path ... See more keywords
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Sign Up to like & getrecommendations! Published in 2025 at "Networks"
DOI: 10.1002/net.22290
Abstract: The Minimum Path Cover (MPC) problem consists of finding a minimum‐cardinality set of node‐disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on directed acyclic graphs… read more here.
Keywords: variant minimum; problem; minimum path; path cover ... See more keywords
On the Complexity of the Bilevel Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2024 at "Networks"
DOI: 10.1002/net.70002
Abstract: We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a… read more here.
Keywords: problem; path; complexity; shortest path ... See more keywords
Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems
Sign Up to like & getrecommendations! Published in 2025 at "Networks"
DOI: 10.1002/net.70014
Abstract: This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search… read more here.
Keywords: row inequalities; vehicle; vehicle routing; unreachable customers ... See more keywords
A dissipation‐based path‐following technique for the phase‐field approach to brittle and ductile fracture
Sign Up to like & getrecommendations! Published in 2021 at "International Journal for Numerical Methods in Engineering"
DOI: 10.1002/nme.6687
Abstract: This article presents a dissipation‐based path‐following technique for the phase‐field approach to brittle and ductile fracture. This technique allows computing the post‐peak response of solids loaded by external forces and snap‐backs in the softening stage.… read more here.
Keywords: based path; dissipation based; path; phase field ... See more keywords
Path Integral Molecular Dynamics of Liquid Water in a Mean-Field Particle Reservoir.
Sign Up to like & getrecommendations! Published in 2022 at "ChemistryOpen"
DOI: 10.1002/open.202100286
Abstract: We present a simulation scheme for path integral simulation of molecular liquids where a small open region is embedded in a large reservoir of non interacting point-particles. The scheme is based on the latest development… read more here.
Keywords: liquid water; integral molecular; path; path integral ... See more keywords