Results 51 to 60 of about 1,092 (193)

Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems

open access: yesNetworks, 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

Digraph groups corresponding to digrahs with one more vertex than arcs

open access: yes, 2022
Cuno & Williams [1] examined digraph groups Γ() in which the undirected graph is triangle free and |()| = |()| (the number of generators and realtors are equal).
Cihan, Mehmet Sefa
core   +1 more source

Teaching Reading as a Complex and Multidimensional Process

open access: yesThe 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

Common circulant homogeneous factorisations of the complete digraph

open access: yes, 2009
In this paper we determine the positive integers n and k for which there exists a homogeneous factorisation of a complete digraph on n vertices with k ‘common circulant’ factors.
Stringer, Linda   +2 more
core   +1 more source

Finding a subdivision of a prescribed digraph of order 4 [PDF]

open access: yes, 2017
International audienceThe problem of when a given digraph contains a subdivision of a fixed digraph F is considered. Bang-Jensen et al. [2] laid out foundations for approaching this problem from the algorith-mic point of view.
Mohar, Bojan   +5 more
core   +1 more source

Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements

open access: yesInternational 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

Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory [PDF]

open access: yesCombinatorica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
João Araújo 0002   +4 more
openaire   +4 more sources

Assessing Barriers to Adoption of Battery Electric Vehicles Using Decision‐Making Trial and Evaluation Laboratory Combined With Analytic Network Process

open access: yesEnergy Science &Engineering, Volume 14, Issue 1, Page 236-256, January 2026.
The study analyzes barriers to electric vehicle growth in India using DEMATEL and ANP. It distinguishes cause‐and‐effect barriers and ranks them. Major barriers include poor charging infrastructure and high costs. ABSTRACT This study employs a hybrid technique based on the Decision‐Making Trial Evaluation Laboratory (DEMATEL), Analytic Network Process (
Sanjeev Kumar   +6 more
wiley   +1 more source

Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups

open access: yesDiscrete Mathematics, 2000
Let \(\Delta\) be a subset of a finite abelian group \(A\) (additively written). Furthermore, let \(\varphi\) be a nonzero endomorphism of \(A\). The endo-circulant digraph \(G_A(\varphi,\Delta)\) is defined with the vertex set consisting of the elements of \(A\) so that, from any \(x\in A\), edges lead to the elements \(\varphi(x)+ \alpha\), where ...
Josep M. Brunat, Montserrat Maureso
openaire   +2 more sources

Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups

open access: yesThe Art of Discrete and Applied Mathematics, 2020
Let $Γ=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(Γ)$. The Cayley index of $Γ$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a noncyclic regular subgroup, then the Cayley index of $Γ$ is superexponential in $p$.
Luke Morgan, Joy Morris, Gabriel Verret
openaire   +4 more sources

Home - About - Disclaimer - Privacy