Results 131 to 140 of about 9,033 (258)

Lifts of continuous and Hölder alpha curves in the configuration space MN/SN$M^N/S_N$

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract In this paper, we study the quotient space X=MN/SN$X = M^N / S_N$ of equivalence classes of N$N$‐tuples in a metric space (M,dM)$(M, d_M)$, equipped with the metric induced by the minimal total pairing distance. Given a continuous path F:(0,1)→X$F: (0,1) \rightarrow X$, we prove that there exist continuous functions f1,⋯,fN:(0,1)→M$f_1, \dots,
Charles L. Fefferman   +3 more
wiley   +1 more source

Function theory on the annulus in the dp-norm. [PDF]

open access: yesIntegr Equ Oper Theory
Agler J, Lykova ZA, Young NJ.
europepmc   +1 more source

Context‐free graphs and their transition groups

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli   +3 more
wiley   +1 more source

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 6, Page 3905-3933, November 2026.
Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints.
Enrique García‐Galán   +2 more
wiley   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

open access: yesJournal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová   +3 more
wiley   +1 more source

Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 5, Page 3580-3597, September 2026.
Abstract This paper introduces a novel heuristic method, the smart selective navigator (SSN), for addressing arc routing problems (ARPs) with a focus on integrating hard turn restrictions in urban winter operations. Addressing a significant gap in existing ARP methodologies, SSN seamlessly incorporates common side constraints, such as vehicle ...
Farhad Baghyari, Jaho Seo
wiley   +1 more source

Winning is not the only metric: the complexity of control manipulation in knockout tournaments for a redefined goal

open access: yesInternational Transactions in Operational Research, Volume 33, Issue 5, Page 3110-3127, September 2026.
Abstract We study control manipulation by generalizing the notion of success in knockout tournaments. The definition of success can be broadened to include other concepts of accomplishment rather than focusing solely on the identity of the tournament winner. Manipulation can be done in favor of diverse stakeholders.
Hadassa Daltrophe   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy