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

120
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...
120
Randomized Experiments01:13

Randomized Experiments

8.2K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
8.2K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

798
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
798
Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model01:13

Parameters Affecting Nonlinear Elimination: Zero-Order Input, First-Order Absorption and Two-Compartment Model

141
Drugs administered through various routes can lead to nonlinear elimination, resulting in complex pharmacokinetic behaviors crucial to understanding efficacious drug dosing.
When a drug is administered through a constant intravenous infusion and eliminated via nonlinear pharmacokinetics, it follows zero-order input. For example, oral drugs undergo first-order absorption upon administration and are eliminated through nonlinear pharmacokinetics.
In the case of subcutaneously administered drugs,...
141
Wald-Wolfowitz Runs Test I01:17

Wald-Wolfowitz Runs Test I

758
The Wald-Wolfowitz test, also known as the runs test, is a nonparametric statistical test used to assess the randomness of a sequence of two different types of elements (e.g., positive/negative values, successes/failures). It examines whether the order of the elements in a sequence is random or if there is a pattern or trend present. This nonparametric test applies to any ordered data despite the population and sample data distribution, even if a higher sample size is available.
The test works...
758
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

818
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
818

You might also read

Related Articles

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

Sort by
Same author

Best Fit Bin Packing with Random Order Revisited.

Algorithmica·2021
Same author

Scheduling in the Random-Order Model.

Algorithmica·2021
Same author

Motivating Time-Inconsistent Agents: A Computational Approach.

Theory of computing systems·2019
Same journal

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.

Algorithmica·2026
Same journal

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games.

Algorithmica·2026
Same journal

Fully Characterizing Lossy Catalytic Computation.

Algorithmica·2026
Same journal

Parameterized Complexities of Dominating and Independent Set Reconfiguration.

Algorithmica·2026
Same journal

The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms.

Algorithmica·2026
Same journal

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.

Algorithmica·2025
See all related articles

Related Experiment Video

Updated: Oct 14, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.2K

Improved Online Algorithms for Knapsack and GAP in the Random Order Model.

Susanne Albers1, Arindam Khan2, Leon Ladewig1

  • 1Department of Computer Science, Technische Universität München, Boltzmannstr. 3, 85748 Garching, Germany.

Algorithmica
|November 1, 2021
PubMed
Summary
This summary is machine-generated.

Researchers developed a new randomized algorithm for the online knapsack problem, achieving a 1/6.65 competitive ratio. This improves upon existing methods for online combinatorial optimization and the generalized assignment problem.

Keywords:
Online algorithmsPacking problemsRandom order model

More Related Videos

Barnes Maze Testing Strategies with Small and Large Rodent Models
12:59

Barnes Maze Testing Strategies with Small and Large Rodent Models

Published on: February 26, 2014

42.6K
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.1K

Related Experiment Videos

Last Updated: Oct 14, 2025

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.2K
Barnes Maze Testing Strategies with Small and Large Rodent Models
12:59

Barnes Maze Testing Strategies with Small and Large Rodent Models

Published on: February 26, 2014

42.6K
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.1K

Area of Science:

  • Combinatorial Optimization
  • Algorithm Design
  • Theoretical Computer Science

Background:

  • The knapsack problem involves maximizing profit within a bounded capacity.
  • Online variants require immediate decisions on item packing as they arrive.
  • The generalized assignment problem (GAP) is related to scheduling and matching.

Purpose of the Study:

  • To develop a more competitive online algorithm for the knapsack problem.
  • To analyze and improve algorithms for the generalized assignment problem in an online setting.
  • To advance the understanding of online combinatorial optimization under random order.

Main Methods:

  • Introduced a novel sequential approach using two specialized algorithms.
  • Exploited the connection between the knapsack problem and the 2-secretary problem.
  • Studied algorithms in the random order model (uniform random permutation).

Main Results:

  • Achieved a randomized (1/6.65)-competitive algorithm for the online knapsack problem.
  • This result surpasses the previous best competitive ratio of 1/8.06.
  • Developed a (1/6.99)-competitive randomized algorithm for the online generalized assignment problem, also outperforming prior work.

Conclusions:

  • The proposed sequential algorithmic approach offers significant improvements in competitive ratios.
  • New insights into the knapsack problem and its relation to other combinatorial problems are demonstrated.
  • The findings advance the state-of-the-art in online combinatorial optimization algorithms.