KIT-Bibliothek
suchen
KIT-Bibliothek
KIT-Bibliothek Medienportal

Mixed-Integer Optimization II, Section 3.4.4 (A purely discrete problem equivalent to MICP)

Diese Audio- bzw. Video-Datei ist urheberrechtlich geschützt. Der Zugriff ist nur über Rechner des Karlsruher Instituts für Technologie (KIT) erlaubt.

Autor

Oliver Stein

Beteiligtes Institut

Institut für Operations Research (IOR)

Genre

Vorlesung

Beschreibung

Lectures on nonlinear mixed-integer optimization at Karlsruhe Institute of Technology

Laufzeit (hh:mm:ss)

00:15:13

Serie

Mixed-Integer Optimization II

Publiziert am

19.09.2022

Fachgebiet

Wirtschaftswissenschaften

Lizenz

KITopen-Lizenz

Auflösung 1280 x 720 Pixel
Seitenverhältnis 16:9
Audiobitrate 129549 bps
Audio Kanäle 2
Audio Codec aac
Audio Abtastrate 48000 Hz
Gesamtbitrate 938966 bps
Farbraum yuv420p
Container mov,mp4,m4a,3gp,3g2,mj2
Medientyp video/mp4
Dauer 913 s
Dateiname DIVA-2022-341_hd.mp4
Dateigröße 107.192.445 byte
Bildwiederholfrequenz 25
Videobitrate 803422 bps
Video Codec h264

Embed-Code

Mixed-Integer Optimization II Folgen 1-31 von 31
Mixed-Integer Optimization II, Section 3.8.3 (Feasibility pump), Section 3.8.4 (Metaheuristics)
Mixed-Integer Optimization II, Section 3.8.3 (Feasibility pump), Section 3.8.4 (Metaheuristics)
Mixed-Integer Optimization II, Section 3.8.1 (Diving heuristics), Section 3.8.2 (Local branching)
Mixed-Integer Optimization II, Section 3.8.1 (Diving heuristics), Section 3.8.2 (Local branching)
Mixed-Integer Optimization II, Section 3.7.4 (Initialization)
Mixed-Integer Optimization II, Section 3.7.4 (Initialization)
Mixed-Integer Optimization II, Section 3.7.3 (Pricing)
Mixed-Integer Optimization II, Section 3.7.3 (Pricing)
Mixed-Integer Optimization II, Section 3.7.2 (Column generation)
Mixed-Integer Optimization II, Section 3.7.2 (Column generation)
Mixed-Integer Optimization II, Section 3.7.1 (Dantzig-Wolfe decomposition, motivation and construction)
Mixed-Integer Optimization II, Section 3.7.1 (Dantzig-Wolfe decomposition, motivation and construction)
Mixed-Integer Optimization II, Section 3.6.4 (A subgradient method)
Mixed-Integer Optimization II, Section 3.6.4 (A subgradient method)
Mixed-Integer Optimization II, Section 3.6.3 (Comparison to continuous relaxation)
Mixed-Integer Optimization II, Section 3.6.3 (Comparison to continuous relaxation)
Mixed-Integer Optimization II, Section 3.6.2 (Decomposition by Lagrange relaxation)
Mixed-Integer Optimization II, Section 3.6.2 (Decomposition by Lagrange relaxation)
Mixed-Integer Optimization II, Section 3.6.1 (Lagrange relaxation, construction and relaxation property)
Mixed-Integer Optimization II, Section 3.6.1 (Lagrange relaxation, construction and relaxation property)
Mixed-Integer Optimization II, Section 3.5.4 (Cutting plane method for MICP), part 2
Mixed-Integer Optimization II, Section 3.5.4 (Cutting plane method for MICP), part 2
Mixed-Integer Optimization II, Section 3.5.4 (Cutting plane method for MICP), part 1
Mixed-Integer Optimization II, Section 3.5.4 (Cutting plane method for MICP), part 1
Mixed-Integer Optimization II, Section 3.5.3 (Optimality cuts)
Mixed-Integer Optimization II, Section 3.5.3 (Optimality cuts)
Mixed-Integer Optimization II, Section 3.5.2 (Feasibility cuts)
Mixed-Integer Optimization II, Section 3.5.2 (Feasibility cuts)
Mixed-Integer Optimization II, Section 3.5.1 (Motivation of the Outer Approximation method)
Mixed-Integer Optimization II, Section 3.5.1 (Motivation of the Outer Approximation method)
Mixed-Integer Optimization II, Section 3.4.7 (Cutting plane method for MICP), part 2
Mixed-Integer Optimization II, Section 3.4.7 (Cutting plane method for MICP), part 2
Mixed-Integer Optimization II, Section 3.4.7 (Cutting plane method for MICP), part 1
Mixed-Integer Optimization II, Section 3.4.7 (Cutting plane method for MICP), part 1
Mixed-Integer Optimization II, Section 3.4.6 (Feasibility cuts)
Mixed-Integer Optimization II, Section 3.4.6 (Feasibility cuts)
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 3
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 3
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 2
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 2
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 1
Mixed-Integer Optimization II, Section 3.4.5 (Optimality cuts), part 1
Mixed-Integer Optimization II, Section 3.4.4 (A purely discrete problem equivalent to MICP)
Mixed-Integer Optimization II, Section 3.4.4 (A purely discrete problem equivalent to MICP)
Mixed-Integer Optimization II, Section 3.4.3 (A functional description of the reduced feasible set)
Mixed-Integer Optimization II, Section 3.4.3 (A functional description of the reduced feasible set)
Mixed-Integer Optimization II, Section 3.4.2 (Convexity of the reduced feasible set and of the reduced objective function)
Mixed-Integer Optimization II, Section 3.4.2 (Convexity of the reduced feasible set and of the reduced objective function)
Mixed-Integer Optimization II, Section 3.4.1 (Reduced feasible set and reduced objective function)
Mixed-Integer Optimization II, Section 3.4.1 (Reduced feasible set and reduced objective function)
Mixed-Integer Optimization II, Section 3.4 (Generalized Benders decomposition, Introduction)
Mixed-Integer Optimization II, Section 3.4 (Generalized Benders decomposition, Introduction)
Mixed-Integer Optimization II, Section 3.3.3 (The nonconvex case)
Mixed-Integer Optimization II, Section 3.3.3 (The nonconvex case)
Mixed-Integer Optimization II, Section 3.3.1 (B&B für MINLP - A conceptual algorithm), Section 3.3.2 (The convex case)
Mixed-Integer Optimization II, Section 3.3.1 (B&B für MINLP - A conceptual algorithm), Section 3.3.2 (The convex case)
Mixed-Integer Optimization II, Section 3.2 (Continuous relaxation and rounding)
Mixed-Integer Optimization II, Section 3.2 (Continuous relaxation and rounding)
Mixed-Integer Optimization II, Section 3.1 (Models in portfolio optimization)
Mixed-Integer Optimization II, Section 3.1 (Models in portfolio optimization)
Mixed-Integer Optimization II, Section 3 (Mixed-integer nonlinear optimization), Introduction
Mixed-Integer Optimization II, Section 3 (Mixed-integer nonlinear optimization), Introduction