Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
Bioinspired Bare Bones Mayfly Algorithm for Large-Scale Spherical Minimum Spanning Tree. [PDF]
Front Bioeng Biotechnol, 2022 Zhang T, Zhou Y, Zhou G, Deng W, Luo Q.
europepmc +1 more source
Micromachined Double‐Membrane Mechanically Tunable Metamaterial for Thermal Infrared Filtering
Advanced Photonics Research, Volume 6, Issue 5, May 2025.Herein, a mechanically tunable double‐layer plasmonic metamaterial leveraging the extraordinary optical transmission effect observed in subwavelength arrays of openings within thin metal layers is presented. The concept is experimentally validated by integrating the proposed metamaterial structure into an electrostatic parallel‐plate actuator to create
Oleg Bannik +7 more
wiley +1 more source
Aberrant dynamic minimal spanning tree parameters within default mode network in patients with autism spectrum disorder. [PDF]
Front Psychiatry, 2022 Jia H, Wu X, Wu Z, Wang E.
europepmc +1 more source
Advanced Robotics Research, EarlyView.A novel carbon fiber reinforcement for dielectric elastomer actuators enhances actuation force while decoupling electromechanical performance from the actuator's aspect ratio. Unlike conventional fiber reinforcements, it enables a uniform planar stretch state along the entire actuator.
Markus Koenigsdorff +8 more
wiley +1 more source
No advantageous merging in minimum cost spanning tree problems
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node.
Vidal-Puga, Juan, Gomez-Rua, Maria
core
On Stock Market Dynamics through Ultrametricity of Minimum Spanning Tree [PDF]
We analyze the evolving price °uctuations by using ultrametric distance of minimally spanning ¯nancial tree of stocks traded in Jakarta Stock Exchange 2000-2004.
Hokky Situngkir, Yohanes Surya
core
Spanning Trees in Regular Graphs
European Journal of Combinatorics, 1983 Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(X)
openaire +1 more source
Collision‐Resilient Winged Drones Enabled by Tensegrity Structures
Advanced Robotics Research, EarlyView.Based on structures of birds such as the woodpeck, this article presents the collision‐resilient aerial robot, SWIFT. SWIFT leverages tensegrity structures in the fuselage and wings which allow it to undergo large deformations in a crash, without sustaining damage. Experiments show that SWIFT can reduce impact forces by 70% over conventional structures.
Omar Aloui +5 more
wiley +1 more source
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.minimum cost ...
Vidal-Puga, Juan, Bergantiños, Gustavo
core