Results 41 to 50 of about 116,505 (190)

How many matchings cover the nodes of a graph?

, 2018
Given an undirected graph, are there $k$ matchings whose union covers all of its nodes, that is, a matching-$k$-cover? A first, easy polynomial solution from matroid union is possible, as already observed by Wang, Song and Yuan (Mathematical Programming,
Ferhat, Dehia Ait, Király, Zoltán, Sebő, András, Stauffer, Gautier   +3 more
core   +1 more source

Does ESG Investing Pay off? Comparing the Performance of ESG and Traditional ETFs Across European and US Markets

Business Strategy and the Environment, EarlyView.
ABSTRACT Investors have long recognized the importance of firms in promoting sustainability, leading to the rise of socially responsible investment (SRI). Specifically, there is a growing preference for exchange‐traded funds (ETFs) that prioritize environmental, social, and governance (ESG) principles.
Sandra Tenorio‐Salgueiro, Andrea Martínez‐Salgueiro, Rubén Lado‐Sestayo, Milagros Vivel‐Búa   +3 more
wiley   +1 more source

Anticoncentration of random vectors via the strong perfect graph theorem [PDF]

, 2023
Tomas Juškevičius, Valentas Kurauskas
openalex   +1 more source

Recursive and Cyclic Constructions for Double‐Change Covering Designs

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A double‐change covering design (DCCD) is a v $v$‐set V $V$ and an ordered list L ${\mathscr{L}}$ of b $b$ blocks of size k $k$ where every pair from V $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly two elements. It is minimal if it has the fewest blocks possible and circular when the first and last
Amanda Lynn Chafee, Brett Stevens
wiley   +1 more source

Propagating Conjunctions of AllDifferent Constraints

, 2010
We study propagation algorithms for the conjunction of two AllDifferent constraints. Solutions of an AllDifferent constraint can be seen as perfect matchings on the variable/value bipartite graph.
Bessiere, Christian, Katsirelos, George, Narodytska, Nina, Quimper, Claude-Guy, Walsh, Toby   +4 more
core   +5 more sources

Subsquares in Random Latin Squares and Rectangles

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A k×n $k\times n$ partial Latin rectangle is C‐sparse $C \mbox{-} \mathrm{sparse}$ if the number of nonempty entries in each row and column is at most C $C$ and each symbol is used at most C $C$ times. We prove that the probability a uniformly random k×n $k\times n$ Latin rectangle, where k<(1∕2−α)n $k\lt (1\unicode{x02215}2-\alpha )n ...
Alexander Divoux, Tom Kelly, Camille Kennedy, Jasdeep Sidhu   +3 more
wiley   +1 more source

Last‐minute coordination: Adapting to demand to support last‐mile operations

Journal of Operations Management, Volume 71, Issue 2, Page 176-194, March 2025.
Abstract In the highly competitive e‐commerce industry, customer‐facing warehouses are crucial as the “order penetration points” for e‐commerce last‐mile operations. This research examines how warehouses use last‐minute coordination, an unstructured mechanism, to ensure sufficient inventory at the order penetration points. Previous research has focused
Kedong Chen, Hung‐Chung Su, Kevin Linderman, William Li   +3 more
wiley   +1 more source

On the analyzing of bifurcation properties of the one‐dimensional Mackey–Glass model by using a generalized approach

Mathematical Methods in the Applied Sciences, EarlyView.
The goal of this work is to look at how a nonlinear model describes hematopoiesis and its complexities utilizing commonly used techniques with historical and material links. Based on time delay, the Mackey–Glass model is explored in two instances. To offer a range, the relevance of the parameter impacting stability (bifurcation) is recorded.
Shuai Zhang, Yaya Wang, Hongyin Geng, Wei Gao, Esin Ilhan, Haci Mehmet Baskonus   +5 more
wiley   +1 more source

Perfect Matching Under Precedence Constraints

Networks, EarlyView.
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley   +1 more source

Simulating Quantum State Transfer Between Distributed Devices Using Noisy Interconnects

Advanced Quantum Technologies, EarlyView.
Noisy connections challenge future networked quantum computers. This work presents a practical method to address this by simulating an ideal state transfer over noisy interconnects. The approach reduces the high sampling cost of previous methods, an advantage that improves as interconnect quality gets better.
Marvin Bechtold, Johanna Barzen, Frank Leymann, Alexander Mandl   +3 more
wiley   +1 more source