Results 171 to 180 of about 154,862 (311)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

Networks, EarlyView.
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 (DAGs) where, given a subset of arcs, each path within the MPC should contain at least one arc from this subset.
Nour ElHouda Tellache, Roberto Baldacci
wiley   +1 more source

Construction of spectral invariants of Hamiltonian paths on closed symplectic manifolds

, 2004
Yong‐Geun Oh
openalex   +2 more sources

Paths and compatible hamiltonian cycles

, 2017
Aquest projecte està centrat en estudiar condicions que fan que un conjunt de punts tinguin un camí d'expansió que sigui compatible amb un cicle Hamiltonià. Hem demostrat que ser un camí monòton o self-approaching és condició suficient per asegurar que hi ha un cicle Hamiltonià compatible.
openaire   +1 more source

Sensitivity‐Based Distributed Model Predictive Control for Non‐Linear Systems Under Inexact Optimization

Optimal Control Applications and Methods, EarlyView.
This article introduces a novel sensitivity‐based algorithm for nonlinear distributed model predictive control. The algorithm requires only local computations with one neighbor‐to‐neighbor communication step per iteration and exhibits a linear order of convergence under suitable conditions.
Maximilian Pierer von Esch, Andreas Völz, Knut Graichen   +2 more
wiley   +1 more source

Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms

International Journal of Industrial Engineering and Production Research, 2011
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city ...
M. Yaghini, M. Momeni, M. Sarmadi
doaj  

Efficient and accurate binding free energy calculation of Aβ9–40 protofilament propagation

Proteins: Structure, Function, and Bioinformatics, EarlyView.
Abstract Self‐assembled aggregation of peptides and proteins into regular amyloid fibrils is associated with several neurodegenerative diseases. In case of Alzheimer's disease proteolytic cleavage products of the amyloid precursor protein form pathological amyloid‐beta fibrils in a nucleation and propagation phase.
Christina V. Frost, Nadine Schwierz, Martin Zacharias   +2 more
wiley   +1 more source

Effects of Galactic Irradiation on Thermal and Electronic Transport in Tungsten

physica status solidi (b), EarlyView.
This atomic‐scale study reveals how low‐to‐mid‐energy space irradiation alters tungsten's thermal and electronic behavior, even at low defect levels. Focusing on vacancy sites in bulk and near grain boundaries, it employs two novel approaches: site‐projected thermal conductivity and the N2$^{2}$ method for the thermal and electronic response analysis ...
Chinonso Ugwumadu, David A. Drabold, Roxanne M. Tutchton   +2 more
wiley   +1 more source

On the existence of Hamiltonian paths connecting Lagrangian submanifolds

, 2005
Nassif Ghoussoub, Abbas Moameni
openalex   +2 more sources

Goodness of cycles and Hamiltonian paths

, 2019
Introduction. The problem of finding an optimal Hamiltonian cycle on a set of complex plane points (TSP) is a well-known open problem. If the number of points is small, we can simply calculate all the possible cycles and stay with a shorter one, but this strategy is not viable when the number of points is large.
de Arriba Perez, Francisco, Corbacho, Cristina, Somoza López, María del Carmen, Vidal Vázquez, Ricardo   +3 more
openaire   +1 more source