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

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

408
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
408
Optimization Problems01:26

Optimization Problems

189
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
189
Methods of Medium Optimization01:28

Methods of Medium Optimization

58
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
58
Optimal Foraging00:48

Optimal Foraging

14.3K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
14.3K
Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

525
Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...
525
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

281
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
281

You might also read

Related Articles

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

Sort by
Same author

Autoantibodies to IL-1Ra and PGRN in severe COVID-19 are associated with inflammation-induced hyperphosphorylated antigen isoforms.

Nature communications·2026
Same author

Plasmacytic markers as immunotherapeutic targets for primary CD20-negative aggressive B-cell lymphomas.

British journal of haematology·2026
Same author

Regional dynamics drive differences in future heat stress and reveal where Hawaiian corals are most likely to persist.

Scientific reports·2026
Same author

Reprogramming of stroma-derived chemokine networks drives the loss of tissue organization in nodal B cell lymphoma.

Nature cancer·2026
Same author

Impact of Perforin 1 A91V germ line background in patients with aggressive B-NHL treated with R-CHOP.

Blood advances·2026
Same author

Axicabtagene ciloleucel in combination with rituximab for refractory large B cell lymphoma: the phase 2, single-arm ZUMA-14 trial.

Nature cancer·2026
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

Related Experiment Video

Updated: Apr 7, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.6K

Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.

Tobias Friedrich1, Frank Neumann2

  • 1Hasso Plattner Institute, Potsdam, Germany friedrich@hpi.de.

Evolutionary Computation
|July 3, 2015
PubMed
Summary
This summary is machine-generated.

This study analyzes evolutionary algorithms for submodular optimization problems. Researchers found specific algorithms achieve good approximations for monotone and nonmonotone submodular functions within polynomial time.

Keywords:
Submodular functionsapproximationhypervolume indicatormatroid constraintsmaximum cutmultiobjective optimizationruntimetheory

More Related Videos

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.4K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

8.1K

Related Experiment Videos

Last Updated: Apr 7, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

13.6K
The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.4K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

8.1K

Area of Science:

  • Computer Science
  • Optimization Theory
  • Algorithm Analysis

Background:

  • Many combinatorial optimization problems utilize submodular functions.
  • Finding optimal solutions for submodular functions under constraints is a key challenge.

Purpose of the Study:

  • To analyze the runtime of evolutionary algorithms for approximating submodular functions.
  • To evaluate the performance of (1 + 1) EA and GSEMO on various submodular function and constraint types.

Main Methods:

  • Investigated the runtime of a single-objective evolutionary algorithm ((1 + 1) EA).
  • Examined the performance of a multiobjective evolutionary algorithm (GSEMO).
  • Analyzed approximation ratios for monotone and nonmonotone submodular functions with matroid intersection constraints.

Main Results:

  • GSEMO achieves a (1 - 1/e)-approximation for monotone submodular functions with uniform cardinality constraints in expected polynomial time.
  • The (1 + 1) EA provides a (1/k + δ)-approximation for monotone functions with K ≥ 2 matroid intersection constraints.
  • GSEMO yields a 1/((k + 2)(1 + ε))-approximation for nonmonotone symmetric submodular functions with k ≥ 1 matroid intersection constraints.

Conclusions:

  • Evolutionary algorithms like (1 + 1) EA and GSEMO are effective for approximating solutions to submodular optimization problems.
  • The specific approximation ratios depend on the nature of the submodular function (monotone/nonmonotone) and the complexity of the constraints (matroid intersections).