Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Synthesis and Decomposition Reactions02:17

Synthesis and Decomposition Reactions

38.1K
Synthesis and decomposition are two types of redox reactions. Synthesis means to make something, whereas decomposition means to break something. The reactions are accompanied by chemical and energy changes. 
38.1K
The Tree of Life - Bacteria, Archaea, Eukaryotes02:40

The Tree of Life - Bacteria, Archaea, Eukaryotes

38.0K
The “tree of life” describes the evolution of life and the evolutionary relationships between organisms. The root of the tree is the common ancestor to all life on Earth. All other species radiate from this point, much like the branches of a tree. The numerous tips of these branches on the tree of life represent every living, or extant, species. Extinct species, which are species that no longer exist, can be found towards the center of the tree. Currently, these organisms, both...
38.0K
Survival Tree01:19

Survival Tree

393
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
393
The Bronchial Tree01:23

The Bronchial Tree

6.4K
The human bronchi and bronchial tree play a crucial role in the respiratory system, facilitating the exchange of oxygen and carbon dioxide. Let's delve into the intricate structure and functions of these respiratory components.
The trachea, commonly known as the windpipe, is a tube that connects the larynx (voice box) to the bronchi. At a point called the carina, it bifurcates into two primary bronchi. The right primary bronchus is wider, shorter, and more vertical than the left primary...
6.4K
Phylogenetic Trees03:21

Phylogenetic Trees

49.3K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
49.3K
Stages of General Anesthesia01:22

Stages of General Anesthesia

1.6K
Various sedation levels offer significant advantages in facilitating procedural interventions for patients undergoing medical or invasive surgical procedures. These levels span from anxiolysis to general anesthesia, providing a spectrum of sedative effects to cater to specific patient needs. Anxiolysis reduces anxiety and is achieved through minimal sedation, enabling patients to remain awake and responsive while feeling more at ease during the procedure. This level can benefit minor...
1.6K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.

Mathematical programming·2024
Same author

Exact solution approaches for the discrete <i>α</i>-neighbor <i>p</i>-center problem.

Networks (New York, NY)·2024
Same author

A note on computational approaches for the antibandwidth problem.

Central European journal of operations research·2021
Same author

Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems.

Computational optimization and applications·2016
Same journal

Distributed inexact Newton method with adaptive step sizes.

Computational optimization and applications·2025
Same journal

Off-the-grid regularisation for Poisson inverse problems.

Computational optimization and applications·2025
Same journal

A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique.

Computational optimization and applications·2024
Same journal

On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction.

Computational optimization and applications·2023
Same journal

On the solution stability of parabolic optimal control problems.

Computational optimization and applications·2023
Same journal

An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function.

Computational optimization and applications·2023
See all related articles

Related Experiment Video

Updated: Jan 22, 2026

A Venturi Effect Can Help Cure Our Trees
05:26

A Venturi Effect Can Help Cure Our Trees

Published on: October 1, 2013

18.4K

Decomposition methods for the two-stage stochastic Steiner tree problem.

Markus Leitner1, Ivana Ljubić2, Martin Luipersbeck1

  • 11University of Vienna, Department of Statistics and Operations Research, Faculty of Business, Economics and Statistics, Vienna, Austria.

Computational Optimization and Applications
|July 2, 2019
PubMed
Summary
This summary is machine-generated.

A novel algorithm for the stochastic Steiner tree problem offers superior performance. This approach utilizes advanced integer programming and dual procedures to efficiently compute bounds and solve complex network problems.

Keywords:
Benders decompositionLagrangian relaxationSteiner treesStochastic optimization

More Related Videos

Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro
06:22

Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro

Published on: August 28, 2019

5.5K
Direct Stochastic Optical Reconstruction Microscopy of Extracellular Vesicles in Three Dimensions
09:36

Direct Stochastic Optical Reconstruction Microscopy of Extracellular Vesicles in Three Dimensions

Published on: August 26, 2021

4.4K

Related Experiment Videos

Last Updated: Jan 22, 2026

A Venturi Effect Can Help Cure Our Trees
05:26

A Venturi Effect Can Help Cure Our Trees

Published on: October 1, 2013

18.4K
Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro
06:22

Stochastic Noise Application for the Assessment of Medial Vestibular Nucleus Neuron Sensitivity In Vitro

Published on: August 28, 2019

5.5K
Direct Stochastic Optical Reconstruction Microscopy of Extracellular Vesicles in Three Dimensions
09:36

Direct Stochastic Optical Reconstruction Microscopy of Extracellular Vesicles in Three Dimensions

Published on: August 26, 2021

4.4K

Area of Science:

  • Operations Research
  • Computer Science
  • Combinatorial Optimization

Background:

  • The stochastic Steiner tree problem is a critical challenge in network design.
  • Existing methods often struggle with large-scale and complex instances.
  • There is a need for more efficient and robust algorithmic solutions.

Purpose of the Study:

  • Introduce a new algorithmic approach for the stochastic Steiner tree problem.
  • Develop a novel integer linear programming formulation.
  • Compare the method's effectiveness against state-of-the-art techniques.

Main Methods:

  • The algorithm integrates three lower bound computation procedures: dual ascent, Lagrangian relaxation, and Benders decomposition.
  • A new, strong integer linear programming formulation is proposed.
  • The method leverages dual information and variable fixing rules to reduce problem size.

Main Results:

  • The proposed method significantly outperforms existing exact and heuristic approaches.
  • Demonstrated effectiveness on both literature benchmark instances and large-scale telecommunication networks.
  • The new integer linear programming formulation is shown to be the strongest known.

Conclusions:

  • The developed algorithmic approach provides a significant advancement in solving the stochastic Steiner tree problem.
  • This method offers improved efficiency and scalability for practical network optimization.
  • The findings have implications for telecommunication network design and other related fields.