Results 51 to 60 of about 27,993 (181)
Networks, Volume 87, Issue 2, Page 111-130, March 2026.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 tree.
Stefan Faldum +2 more
wiley +1 more source
Countable connected-homogeneous digraphs [PDF]
, 2013 A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph.
Hamann, Matthias
core
A sufficient condition for a balanced bipartite digraph to be hamiltonian
, 2017 We describe a new type of sufficient condition for a balanced bipartite digraph to be hamiltonian. Let $D$ be a balanced bipartite digraph and $x,y$ be distinct vertices in $D$.
Wang, Ruixia
core +1 more source
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley +1 more source
Every countable model of set theory embeds into its own constructible universe
, 2014 The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe.
Aczel P. +3 more
core +2 more sources
Teaching Reading as a Complex and Multidimensional Process
The Reading Teacher, Volume 79, Issue 5, March/April 2026.ABSTRACT This article examines the teaching of reading as a complex and multidimensional process amidst current approaches to teaching reading forwarded by new legislation and curricula that have been adopted across the United States. We underscore the importance of a comprehensive understanding of the teaching of early reading by bringing together ...
Faythe Beauchemin +3 more
wiley +1 more source
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2013 Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices u, v,w ∈ V (D), (u, v), (v,w) ∈ A(D) implies that (u,w) ∈ A(D).
Hernández-Cruz César
doaj +1 more source
On the causal interpretation of acyclic mixed graphs under multivariate normality [PDF]
, 2013 In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables.
Drton, Mathias +2 more
core
Optimal segmentation of directed graph and the minimum number of feedback arcs
, 2017 The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles.
Xu, Yi-Zhi, Zhou, Hai-Jun
core +1 more source
Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 100-116, 10 January 2026.ABSTRACT This study develops a solution to the distributed SE(d) formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 more
wiley +1 more source