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

Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

457
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,...
457
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
18.2K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

375
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...
375
Modeling with Differential Equations01:25

Modeling with Differential Equations

131
Population dynamics can be described mathematically by considering the population size P(t) as a function of time. The rate of change of the population is then represented by the derivative of P(t). A simple assumption is that the rate of growth is proportional to the size of the population itself. This leads to an exponential growth model, where the population increases rapidly without bound. While this is a useful first approximation, it does not reflect realistic long-term...
131
Vectors01:30

Vectors

612
Vectors are mathematical entities characterized by both magnitude and direction. Unlike scalars, which are defined solely by magnitude, vectors represent quantities like displacement, velocity, and force, where direction is essential. Vectors are graphically represented as directed line segments, extending from an initial point to a terminal point, denoted with bold letters or arrows placed above the symbol. Two vectors are deemed equal if they share identical magnitudes and directions,...
612
Relation between Mathematical Equations and Block Diagrams01:20

Relation between Mathematical Equations and Block Diagrams

3.6K
In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.
3.6K

You might also read

Related Articles

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

Sort by
Same author

Large neighborhood search and hyper-heuristics for the capacitated p-median problem.

Journal of heuristics·2026
Same author

Modeling and solving staff scheduling with partial weighted maxSAT.

Annals of operations research·2019
Same author

Integer programming model extensions for a multi-stage nurse rostering problem.

Annals of operations research·2019
See all related articles

Related Experiment Video

Updated: Mar 2, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.8K

Modeling high school timetabling with bitvectors.

Emir Demirović1, Nysret Musliu1

  • 1Database and Artificial Intelligence Group, Technische Universität Wien, Vienna, Austria.

Annals of Operations Research
|May 23, 2017
PubMed
Summary
This summary is machine-generated.

We introduce a novel bitvector modeling approach for high school timetabling (HSTT), significantly improving constraint cost calculations for efficient algorithm development and solving via satisfiability modulo theory (SMT).

Keywords:
BitvectorsHigh school timetablingLocal searchModelingSMT

More Related Videos

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling
20:36

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

9.2K

Related Experiment Videos

Last Updated: Mar 2, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.8K
Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling
20:36

Predicting the Effectiveness of Population Replacement Strategy Using Mathematical Modeling

Published on: July 4, 2007

9.2K

Area of Science:

  • Operations Research
  • Computer Science
  • Artificial Intelligence

Background:

  • High school timetabling (HSTT) is a complex combinatorial optimization problem.
  • Finding feasible solutions for HSTT variants is NP-complete, posing significant computational challenges.

Purpose of the Study:

  • To propose a new bitvector-based modeling approach for HSTT.
  • To enable efficient calculation of constraint costs using bit operations.
  • To facilitate solving HSTT problems with satisfiability modulo theory (SMT) solvers.

Main Methods:

  • Developed a novel HSTT model utilizing bitvectors for constraint cost computation.
  • Implemented local search algorithms (hill climbing, simulated annealing) using the bitvector model.
  • Evaluated performance against the KHE engine.
  • Utilized SMT solvers with bitvector support to solve benchmark instances.

Main Results:

  • The bitvector modeling approach allows for efficient computation of constraint costs.
  • The proposed model is effective for developing HSTT algorithms.
  • Experimental results demonstrate the utility of the approach for solving benchmark instances.

Conclusions:

  • The bitvector modeling approach offers a computationally efficient method for HSTT.
  • This approach enhances the applicability of SMT solvers to complex timetabling problems.