Discrete Optimization [2013, ENG]
movies, software, shows...
Files
| additional video materians | |||
| 16 2 16 02 Graph Coloring -Compilers-Professor Alex Aiken - YouTube.flv | 20.64 MB | ||
| Asynchronous Backtracking Algorithm.flv | 32.86 MB | ||
| DISCRETE MATHEMATICS - 29 - GRAPH COLORING.mp4 | 21.86 MB | ||
| DISCRETE MATHEMATICS - 30 - GRAPH COLORING (CONTINUED).mp4 | 15.11 MB | ||
| Filtering Algorithm for Distributed Constraint Satisfaction.mp4 | 21.46 MB | ||
| Grad Course in AI (#5)- Constraint Satisfaction.mp4 | 295.74 MB | ||
| Lecture 23 - Graph Coloring.mp4 | 191.33 MB | ||
| Mod-03 Lec-13 Vertex coloring - Brooks theorem.flv | 189.34 MB | ||
| Mod-03 Lec-14 More on vertex coloring.flv | 191.44 MB | ||
| Mod-03 Lec-17 5- coloring planar graphs, Kuratowsky's theorem.mp4 | 148.63 MB | ||
| Programming Interview_ Graph Coloring using Backtracking.mp4 | 24.3 MB | ||
| assignments | |||
| 01_knapsack | |||
| knapsack.zip | 223.3 KB | ||
| 02_graph_coloring | |||
| coloring.zip | 3.63 MB | ||
| 03_travelling_salesman | |||
| tsp.zip | 1008.41 KB | ||
| 04_warehouse_location | |||
| warehouse.zip | 26.16 MB | ||
| 05_vehicle_routing | |||
| vrp.zip | 274.5 KB | ||
| 06_puzzles | |||
| puzzle.zip | 182.9 KB | ||
| materials | |||
| Additional Materials.pdf | 107.03 KB | ||
| Optimization Tools.pdf | 102.16 KB | ||
| The Community.pdf | 100.91 KB | ||
| slides | |||
| lecture-LDS-LNS.pdf | 1.51 MB | ||
| lecture-TA-program.pdf | 470.13 KB | ||
| lecture-column-generation.pdf | 2.44 MB | ||
| lecture-cp-1.pdf | 7.37 MB | ||
| lecture-cp-10.pdf | 3.53 MB | ||
| lecture-cp-2.pdf | 3.99 MB | ||
| lecture-cp-3.pdf | 5.78 MB | ||
| lecture-cp-4.pdf | 4.52 MB | ||
| lecture-cp-5.pdf | 1.27 MB | ||
| lecture-cp-6.pdf | 1.55 MB | ||
| lecture-cp-7.pdf | 4.29 MB | ||
| lecture-cp-8.pdf | 11.63 MB | ||
| lecture-cp-9.pdf | 3 MB | ||
| lecture-greedy-1.pdf | 980.78 KB | ||
| lecture-greedy-2.pdf | 1.48 MB | ||
| lecture-knapsack-1.pdf | 2.48 MB | ||
| lecture-knapsack-2.pdf | 2.7 MB | ||
| lecture-lp-1.pdf | 2.65 MB | ||
| lecture-lp-2.pdf | 1.24 MB | ||
| lecture-lp-3.pdf | 1.63 MB | ||
| lecture-lp-4.pdf | 1.46 MB | ||
| lecture-lp-5.pdf | 1.74 MB | ||
| lecture-lp-6.pdf | 1.17 MB | ||
| lecture-ls-1.pdf | 11.75 MB | ||
| lecture-ls-2.pdf | 2.7 MB | ||
| lecture-ls-3.pdf | 1.85 MB | ||
| lecture-ls-4.pdf | 1.82 MB | ||
| lecture-ls-5.pdf | 2.58 MB | ||
| lecture-ls-6.pdf | 2 MB | ||
| lecture-ls-7.pdf | 3.55 MB | ||
| lecture-ls-8.pdf | 2.14 MB | ||
| lecture-ls-9.pdf | 1.31 MB | ||
| lecture-mb-1.pdf | 2.38 MB | ||
| lecture-mb-2.pdf | 882.18 KB | ||
| lecture-mb-3.pdf | 2.15 MB | ||
| lecture-mb-4.pdf | 911.47 KB | ||
| lecture-mb-5.pdf | 961.54 KB | ||
| lecture-mb-6.pdf | 649.05 KB | ||
| lecture-mb-8.pdf | 2.15 MB | ||
| lecture-mip-1.pdf | 2.08 MB | ||
| lecture-mip-2.pdf | 2.71 MB | ||
| lecture-mip-3.pdf | 2.29 MB | ||
| lecture-mip-4.pdf | 3.42 MB | ||
| lecture-mip-5.pdf | 2.04 MB | ||
| lecture-scheduling.pdf | 2.34 MB | ||
| subtitles | |||
| 1 - 1 - Getting Started (1101).srt | 19.96 KB | ||
| 1 - 2 - Introduction Screen Name (1347).srt | 23.57 KB | ||
| 1 - 3 - Knapsack External Solver (1213).srt | 21.32 KB | ||
| 1 - 4 - Graph Coloring (623).srt | 10.76 KB | ||
| 1 - 5 - Traveling Salesman (1038).srt | 18.9 KB | ||
| 1 - 6 - Warehouse Location (1152).srt | 20.15 KB | ||
| 1 - 7 - Vehicle Routing (1419).srt | 25.2 KB | ||
| 1 - 8 - Puzzle Challenge (947).srt | 15.85 KB | ||
| 1 - 9 - Optimization Tools (600).srt | 10.6 KB | ||
| 3 - 1 - Course Motivation - Indiana Jones challenges applications (2049).srt | 32.68 KB | ||
| 3 - 2 - Course Introduction - philosophy design grading rubric (1130).srt | 19.94 KB | ||
| 3 - 3 - Knapsack 1 - problem formulation dynamic programming (3420).srt | 58.82 KB | ||
| 3 - 4 - Knapsack 2 - relaxation branch and bound (2239).srt | 39.35 KB | ||
| 3 - 5 - Greedy 1 - intuition tsp (1044).srt | 19.25 KB | ||
| 3 - 6 - Greedy 2 - set cover (1042).srt | 18.62 KB | ||
| 4 - 1 - CP 1 - intuition computational paradigm map coloring n-queens (2716).srt | 50.12 KB | ||
| 4 - 10 - CP 10 - value-variable labeling domain splitting symmetry breaking in search (2845).srt | 48.82 KB | ||
| 4 - 2 - CP 2 - propagation arithmetic constraints sendmoremoney (2620).srt | 45.49 KB | ||
| 4 - 3 - CP 3 - reification element constraint magic series stable marriage (1649).srt | 27.27 KB | ||
| 4 - 4 - CP 4 - global constraint intuition table constraint sudoku (1923).srt | 34.85 KB | ||
| 4 - 5 - CP 5 - symmetry breaking BIBD scene allocation (1830).srt | 31.39 KB | ||
| 4 - 6 - CP 6 - redundant constraints magic series market split (1135).srt | 19.06 KB | ||
| 4 - 7 - CP 7 - car sequencing dual modeling (1820).srt | 33.12 KB | ||
| 4 - 8 - CP 8 - global constraints in detail knapsack alldifferent (3344).srt | 59.79 KB | ||
| 4 - 9 - CP 9 - search first-fail euler knight ESDD (2449).srt | 45.73 KB | ||
| 5 - 1 - LS 1 - intuition n-queens (1357).srt | 23.55 KB | ||
| 5 - 2 - LS 2 - swap neighborhood car sequencing magic square (1514).srt | 24.7 KB | ||
| 5 - 3 - LS 3 - optimization warehouse location traveling salesman 2-opt k-opt (2309).srt | 39.15 KB | ||
| 5 - 4 - LS 4 - optimality vs feasibility graph coloring (2218).srt | 36.26 KB | ||
| 5 - 5 - LS 5 - complex neighborhoods sports scheduling (2242).srt | 36.91 KB | ||
| 5 - 6 - LS 6 - escaping local minima connectivity (1539).srt | 25.62 KB | ||
| 5 - 7 - LS 7 - formalization heuristics meta-heuristics introduction (2246).srt | 42.6 KB | ||
| 5 - 8 - LS 8 - iterated location search metropolis heuristic simulated annealing tabu search intuition (1854).srt | 36.75 KB | ||
| 5 - 9 - LS 9 - tabu search formalized aspiration car sequencing n-queens (2637).srt | 47.76 KB | ||
| 6 - 1 - LP 1 - intuition convexity geometric view (2414).srt | 40.6 KB | ||
| 6 - 10 - MIP 4 - convex hull polyhedral cuts warehouse location node packing graph coloring (1920).srt | 34.76 KB | ||
| 6 - 11 - MIP 5 - cover cuts branch and cut seven bridges traveling salesman (3121).srt | 53.08 KB | ||
| 6 - 2 - LP 2 - algebraic view naive algorithm (1342).srt | 24.52 KB | ||
| 6 - 3 - LP 3 - the simplex algorithm (3222).srt | 55.07 KB | ||
| 6 - 4 - LP 4 - matrix notation the tableau (2052).srt | 34.29 KB | ||
| 6 - 5 - LP 5 - duality derivation (2200).srt | 38.06 KB | ||
| 6 - 6 - LP 6 - duality interpretation and uses (1700).srt | 28.65 KB | ||
| 6 - 7 - MIP 1 - intuition relaxation branch and bound knapsack warehouse location (2616).srt | 46.92 KB | ||
| 6 - 8 - MIP 2 - modeling big-M warehouse location graph coloring (2825).srt | 50.34 KB | ||
| 6 - 9 - MIP 3 - cutting planes Gomory cuts (2047).srt | 35.52 KB | ||
| 7 - 1 - Column Generation - branch and price cutting stock (2304).srt | 40.65 KB | ||
| 7 - 2 - Scheduling - jobshop disjunctive global constraint (3713).srt | 62.9 KB | ||
| 7 - 3 - Limited Discrepancy Search Large Neighborhood Search - asymmetric TSP with time windows (1507).srt | 26.27 KB | ||
| 8 - 1 - Mail Bag - week 1 (1453).srt | 25.08 KB | ||
| 8 - 2 - Mail Bag - week 2 (1912).srt | 32.56 KB | ||
| 8 - 3 - Mail Bag - week 3 (617).srt | 9.95 KB | ||
| 8 - 4 - Mail Bag - week 4 (617).srt | 10.03 KB | ||
| 8 - 5 - Mail Bag - week 5 (717).srt | 11.84 KB | ||
| 8 - 6 - Mail Bag - week 6 (350).srt | 6.56 KB | ||
| 8 - 7 - Mail Bag - week 8 (824).srt | 14.6 KB | ||
| 8 - 8 - TA program (955).srt | 18.71 KB | ||
| video | |||
| 1 - 1 - Getting Started (1101).mp4 | 37.72 MB | ||
| 1 - 2 - Introduction Screen Name (1347).mp4 | 47.36 MB | ||
| 1 - 3 - Knapsack External Solver (1213).mp4 | 41.09 MB | ||
| 1 - 4 - Graph Coloring (623).mp4 | 21.42 MB | ||
| 1 - 5 - Traveling Salesman (1038).mp4 | 36.47 MB | ||
| 1 - 6 - Warehouse Location (1152).mp4 | 40.74 MB | ||
| 1 - 7 - Vehicle Routing (1419).mp4 | 46.98 MB | ||
| 1 - 8 - Puzzle Challenge (947).mp4 | 32.27 MB | ||
| 1 - 9 - Optimization Tools (600).mp4 | 20.46 MB | ||
| 3 - 1 - Course Motivation - Indiana Jones challenges applications (2049).mp4 | 78.15 MB | ||
| 3 - 2 - Course Introduction - philosophy design grading rubric (1130).mp4 | 42.17 MB | ||
| 3 - 3 - Knapsack 1 - problem formulation dynamic programming (3420).mp4 | 122.49 MB | ||
| 3 - 4 - Knapsack 2 - relaxation branch and bound (2239).mp4 | 83.74 MB | ||
| 3 - 5 - Greedy 1 - intuition tsp (1044).mp4 | 34.93 MB | ||
| 3 - 6 - Greedy 2 - set cover (1042).mp4 | 36.2 MB | ||
| 4 - 1 - CP 1 - intuition computational paradigm map coloring n-queens (2716).mp4 | 97.64 MB | ||
| 4 - 10 - CP 10 - value-variable labeling domain splitting symmetry breaking in search (2845).mp4 | 106 MB | ||
| 4 - 2 - CP 2 - propagation arithmetic constraints sendmoremoney (2620).mp4 | 91.11 MB | ||
| 4 - 3 - CP 3 - reification element constraint magic series stable marriage (1649).mp4 | 55.07 MB | ||
| 4 - 4 - CP 4 - global constraint intuition table constraint sudoku (1923).mp4 | 64.1 MB | ||
| 4 - 5 - CP 5 - symmetry breaking BIBD scene allocation (1830).mp4 | 60.38 MB | ||
| 4 - 6 - CP 6 - redundant constraints magic series market split (1135).mp4 | 37.8 MB | ||
| 4 - 7 - CP 7 - car sequencing dual modeling (1820).mp4 | 61.96 MB | ||
| 4 - 8 - CP 8 - global constraints in detail knapsack alldifferent (3344).mp4 | 120.18 MB | ||
| 4 - 9 - CP 9 - search first-fail euler knight ESDD (2449).mp4 | 93.29 MB | ||
| 5 - 1 - LS 1 - intuition n-queens (1357).mp4 | 45.73 MB | ||
| 5 - 2 - LS 2 - swap neighborhood car sequencing magic square (1514).mp4 | 55.29 MB | ||
| 5 - 3 - LS 3 - optimization warehouse location traveling salesman 2-opt k-opt (2309).mp4 | 79.08 MB | ||
| 5 - 4 - LS 4 - optimality vs feasibility graph coloring (2218).mp4 | 80.05 MB | ||
| 5 - 5 - LS 5 - complex neighborhoods sports scheduling (2242).mp4 | 83.12 MB | ||
| 5 - 6 - LS 6 - escaping local minima connectivity (1539).mp4 | 55.11 MB | ||
| 5 - 7 - LS 7 - formalization heuristics meta-heuristics introduction (2246).mp4 | 97.2 MB | ||
| 5 - 8 - LS 8 - iterated location search metropolis heuristic simulated annealing tabu search intuition (1854).mp4 | 79.46 MB | ||
| 5 - 9 - LS 9 - tabu search formalized aspiration car sequencing n-queens (2637).mp4 | 115.76 MB | ||
| 6 - 1 - LP 1 - intuition convexity geometric view (2414).mp4 | 84.29 MB | ||
| 6 - 10 - MIP 4 - convex hull polyhedral cuts warehouse location node packing graph coloring (1920).mp4 | 65.11 MB | ||
| 6 - 11 - MIP 5 - cover cuts branch and cut seven bridges traveling salesman (3121).mp4 | 110.64 MB | ||
| 6 - 2 - LP 2 - algebraic view naive algorithm (1342).mp4 | 50.3 MB | ||
| 6 - 3 - LP 3 - the simplex algorithm (3222).mp4 | 115.18 MB | ||
| 6 - 4 - LP 4 - matrix notation the tableau (2052).mp4 | 76.12 MB | ||
| 6 - 5 - LP 5 - duality derivation (2200).mp4 | 79.61 MB | ||
| 6 - 6 - LP 6 - duality interpretation and uses (1700).mp4 | 60.41 MB | ||
| 6 - 7 - MIP 1 - intuition relaxation branch and bound knapsack warehouse location (2616).mp4 | 97.73 MB | ||
| 6 - 8 - MIP 2 - modeling big-M warehouse location graph coloring (2825).mp4 | 104.84 MB | ||
| 6 - 9 - MIP 3 - cutting planes Gomory cuts (2047).mp4 | 74.27 MB | ||
| 7 - 1 - Column Generation - branch and price cutting stock (2304).mp4 | 81.51 MB | ||
| 7 - 2 - Scheduling - jobshop disjunctive global constraint (3713).mp4 | 133.48 MB | ||
| 7 - 3 - Limited Discrepancy Search Large Neighborhood Search - asymmetric TSP with time windows (1507).mp4 | 56.89 MB | ||
| 8 - 1 - Mail Bag - week 1 (1453).mp4 | 51.75 MB | ||
| 8 - 2 - Mail Bag - week 2 (1912).mp4 | 64.54 MB | ||
| 8 - 3 - Mail Bag - week 3 (617).mp4 | 6.03 MB | ||
| 8 - 4 - Mail Bag - week 4 (617).mp4 | 5.64 MB | ||
| 8 - 5 - Mail Bag - week 5 (717).mp4 | 19.27 MB | ||
| 8 - 6 - Mail Bag - week 6 (350).mp4 | 10.74 MB | ||
| 8 - 7 - Mail Bag - week 8 (824).mp4 | 23.15 MB | ||
| 8 - 8 - TA program (955).mp4 | 29.57 MB |
Description
Обучающие видео » Компьютерные видеоуроки и обучающие интерактивные DVD » Программирование (видеоуроки)
Discrete Optimization
Год выпуска: 2013
Производитель: Coursera / University of Melbourne
Сайт производителя: https://www.coursera.org/course/optimization
Автор: Pascal Van Hentenryck
Продолжительность: 17:00:56
Тип раздаваемого материала: Видеоурок
Язык: Английский
Описание: Дискретная оптимизация — раздел математического программирования. Задачи комбинаторной оптимизации можно решить с помощью методов дискретного программирования. Одними из основных методов решения задач дискретного программирования являются метод ветвей и границ и динамическое программирование. О них и других методах рассказывается в курсе.
[spoiler="About the Course"]
Optimization technology is ubiquitous in our society. It schedules planes and their crews, coordinates the production of steel, and organizes the transportation of iron ore from the mines to the ports. Optimization clears the day-ahead and real-time markets to deliver electricity to millions of people. It organizes kidney exchanges and cancer treatments and helps scientists understand the fundamental fabric of life, control complex chemical reactions, and design drugs that may benefit billions of individuals.
This class is an introduction to discrete optimization and exposes students to some of the most fundamental concepts and algorithms in the field. It covers constraint programming, local search, and mixed-integer programming from their foundations to their applications for complex practical problems in areas such as scheduling, vehicle routing, supply-chain optimization, and resource allocation.
[/spoiler]
[spoiler="Содержание"]
Course Syllabus
The course has an open format. At the start of the course all of the assignments and lectures are available and each student is free to design their own plan of study. The assessments in the course consist of five programming assignments and one extra credit assignment. In the programming assignments, students experience the challenges of real world optimization problems such as selecting the most profitable locations of retail stores (warehouse location) and the design of package delivery routes (vehicle routing). The class community is an important aspect of this course and students are encouraged to collaborate and help each other in the completion of the assignments.
[/spoiler]
Файлы примеров: присутствуют
Формат видео: MP4
Видео: AVC, 960x540, 16:9, 29.970 fps, 391 Kbps
Аудио: AAC, 44.1 KHz, 128 Kbps, Stereo
[spoiler="Отчет Mediainfo"]
General
Complete name : 3 - 1 - Course Motivation - Indiana Jones challenges applications (2049).mp4
Format : MPEG-4
Format profile : Base Media
Codec ID : isom
File size : 78.1 MiB
Duration : 20mn 49s
Overall bit rate mode : Variable
Overall bit rate : 525 Kbps
Writing application : Lavf53.29.100
Video
ID : 1
Format : AVC
Format/Info : Advanced Video Codec
Format profile : [email protected]
Format settings, CABAC : Yes
Format settings, ReFrames : 4 frames
Codec ID : avc1
Codec ID/Info : Advanced Video Coding
Duration : 20mn 49s
Bit rate : 391 Kbps
Width : 960 pixels
Height : 540 pixels
Display aspect ratio : 16:9
Frame rate mode : Constant
Frame rate : 29.970 fps
Color space : YUV
Chroma subsampling : 4:2:0
Bit depth : 8 bits
Scan type : Progressive
Bits/(Pixel*Frame) : 0.025
Stream size : 58.1 MiB (74%)
Writing library : x264 core 120 r2120 0c7dab9
Encoding settings : cabac=1 / ref=3 / deblock=1:0:0 / analyse=0x3:0x113 / me=hex / subme=7 / psy=1 / psy_rd=1.00:0.00 / mixed_ref=1 / me_range=16 / chroma_me=1 / trellis=1 / 8x8dct=1 / cqm=0 / deadzone=21,11 / fast_pskip=1 / chroma_qp_offset=-2 / threads=12 / sliced_threads=0 / nr=0 / decimate=1 / interlaced=0 / bluray_compat=0 / constrained_intra=0 / bframes=3 / b_pyramid=2 / b_adapt=1 / b_bias=0 / direct=1 / weightb=1 / open_gop=0 / weightp=2 / keyint=250 / keyint_min=25 / scenecut=40 / intra_refresh=0 / rc_lookahead=40 / rc=crf / mbtree=1 / crf=28.0 / qcomp=0.60 / qpmin=0 / qpmax=69 / qpstep=4 / ip_ratio=1.40 / aq=1:1.00
Audio
ID : 2
Format : AAC
Format/Info : Advanced Audio Codec
Format profile : LC
Codec ID : 40
Duration : 20mn 49s
Bit rate mode : Variable
Bit rate : 128 Kbps
Channel(s) : 2 channels
Channel positions : Front: L R
Sampling rate : 44.1 KHz
Compression mode : Lossy
Delay relative to video : 67ms
Stream size : 18.9 MiB (24%)
[/spoiler]
[spoiler="Скриншоты"]
[/spoiler]
Доп. информация: В раздаче также:
- задания
- слайды
- субтитры
Related Torrents
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
|
Udemy - Discrete Maths - Mathematical Induction and Binomial Theorem Posted by
freecoursewb in Other
|
3.9 GB | freecoursewb | 4 months | 11 | 5 |
| 9.6 GB | tutsnode | 4 years | 0 | 0 | |
|
Udemy - Discrete Maths - Mathematical Induction and Binomial Theorem Posted by
freecoursewb in Other
|
3.9 GB | freecoursewb | 4 years | 0 | 0 |
| 548.7 MB | freecoursewb | 4 years | 0 | 0 | |
| 4 GB | freecoursewb | 4 years | 0 | 0 |
All Comments