Assignment problem

Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (13)

The transhipment problem, The assignment problem

Explores the assignment problem and its transformation into a transhipment problem, showcasing an example with selling masterpieces to children.

Problems with One-Dimensional Limits

Introduces a model problem and discusses the Finite Difference Method.

Laplace Equation: Decomposition and Solutions

Covers the Laplace equation, decomposition of linear problems, and solutions through separation of variables.

Installation: GNU Octave 3.8.0

Covers the installation process of GNU Octave 3.8.0, a high-level interpreted language for numerical computations.

Relations Between Events

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Mixed-Integer Linear Programming: Formulations and Applications

Explores mixed-integer linear programming, binary variables, 0-1 knapsack, assignment problems, and LP relaxation strength.

Discrete Optimization: Definitions

Covers definitions and concepts in discrete optimization, including binary linear problems and combinatorial optimization.

Computational Geomechanics: Unconfined Flow

Explores unconfined flow in computational geomechanics, emphasizing weak form derivation and relative permeability.

Optimal Transport: Introduction and Kantorovich Problem

Introduces the course on optimal transport, covering historical background, concepts of push forward measures, transport maps, and the Kantorovich problem.

Discrete Optimization: Relaxation

Explores solving discrete optimization problems by relaxing integrality constraints.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Non-linear Problem Solving

Introduces solving non-linear problems through differential equations and finite difference methods.

Big-step semantics: Defining arithmetic expressions and commands

Covers the definition of a simple programming language and its big-step semantics, including arithmetic expressions and imperative commands.

Page 1 of 1