Internet Archive's in-browser video player requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your browser settings for this feature.

[Coursera] Discrete Optimization (The University of Melbourne) (optimization)

by: The University of Melbourne

Publisher: Academic Torrents

Contributor: Academic Torrents

Academictorrents_collection: video-lectures

Addeddate: 2018-08-12 13:30:51

External-identifier: urn:academictorrents:ed196d080a2208727a225ab5e7a5630e5bf53be4

Identifier: academictorrents_ed196d080a2208727a225ab5e7a5630e5bf53be4

Ocr: ABBYY FineReader 11.0 (Extended OCR)

Ppi: 600

Scanner: Internet Archive Python library 1.8.1

Source: http://academictorrents.com/details/ed196d080a2208727a225ab5e7a5630e5bf53be4
torrent:urn:sha1:ed196d080a2208727a225ab5e7a5630e5bf53be4

plus-circle Add Review

comment
Reviews

There are no reviews yet. Be the first one to write a review.

4,306 Views

1 Favorite

DOWNLOAD OPTIONS

34 files

ABBYY GZ

BACK

34.3K

03_Knapsack_1_-_intuition_2-29_abbyy.gz

68.1K

04_Knapsack_2_-_greedy_algorithms_7-10_abbyy.gz

32.1K

05_Knapsack_3_-_modeling_8-56_abbyy.gz

48.3K

06_Knapsack_4_-_dynamic_programming_17-58_abbyy.gz

95.0K

07_Knapsack_5_-_relaxation_branch_and_bound_14-49_abbyy.gz

98.3K

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41_abbyy.gz

24.3K

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06_abbyy.gz

146.5K

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16_abbyy.gz

550.4K

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20_abbyy.gz

273.7K

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23_abbyy.gz

100.4K

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30_abbyy.gz

159.4K

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35_abbyy.gz

216.5K

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49_abbyy.gz

189.9K

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45_abbyy.gz

259.9K

01_LS_1_-_intuition_n-queens__13-57_abbyy.gz

202.6K

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09_abbyy.gz

131.7K

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18_abbyy.gz

179.7K

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54_abbyy.gz

142.5K

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37_abbyy.gz

185.4K

01_LP_1_-_intuition_convexity_geometric_view__24-14_abbyy.gz

144.9K

02_LP_2_-_algebraic_view_naive_algorithm__13-42_abbyy.gz

229.2K

03_LP_3_-_the_simplex_algorithm__32-22_abbyy.gz

144.4K

04_LP_4_-_matrix_notation_the_tableau_20-52_abbyy.gz

78.1K

05_LP_5_-_duality_derivation_22-00_abbyy.gz

120.4K

06_LP_6_-_duality_interpretation_and_uses___17-00_abbyy.gz

230.0K

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16_abbyy.gz

332.1K

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25_abbyy.gz

152.5K

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47_abbyy.gz

185.1K

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20_abbyy.gz

137.5K

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21_abbyy.gz

241.5K

02_Column_Generation_-_branch_and_price_cutting_stock_23-04_abbyy.gz

203.5K

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13_abbyy.gz

32.1K

01_Getting_Started_13-42_abbyy.gz

1.9K

points_abbyy.gz

34 files

FULL TEXT

BACK

2.1K

03_Knapsack_1_-_intuition_2-29_djvu.txt

4.1K

04_Knapsack_2_-_greedy_algorithms_7-10_djvu.txt

1.9K

05_Knapsack_3_-_modeling_8-56_djvu.txt

2.8K

06_Knapsack_4_-_dynamic_programming_17-58_djvu.txt

5.4K

07_Knapsack_5_-_relaxation_branch_and_bound_14-49_djvu.txt

5.8K

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41_djvu.txt

1.4K

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06_djvu.txt

8.9K

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16_djvu.txt

28.3K

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20_djvu.txt

16.1K

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23_djvu.txt

6.4K

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30_djvu.txt

10.1K

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35_djvu.txt

13.7K

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49_djvu.txt

11.0K

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45_djvu.txt

19.7K

01_LS_1_-_intuition_n-queens__13-57_djvu.txt

11.0K

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09_djvu.txt

9.0K

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18_djvu.txt

10.7K

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54_djvu.txt

10.7K

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37_djvu.txt

11.9K

01_LP_1_-_intuition_convexity_geometric_view__24-14_djvu.txt

9.1K

02_LP_2_-_algebraic_view_naive_algorithm__13-42_djvu.txt

12.2K

03_LP_3_-_the_simplex_algorithm__32-22_djvu.txt

8.1K

04_LP_4_-_matrix_notation_the_tableau_20-52_djvu.txt

4.1K

05_LP_5_-_duality_derivation_22-00_djvu.txt

6.4K

06_LP_6_-_duality_interpretation_and_uses___17-00_djvu.txt

14.2K

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16_djvu.txt

18.6K

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25_djvu.txt

9.0K

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47_djvu.txt

11.8K

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20_djvu.txt

6.9K

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21_djvu.txt

14.1K

02_Column_Generation_-_branch_and_price_cutting_stock_23-04_djvu.txt

12.9K

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13_djvu.txt

1.9K

01_Getting_Started_13-42_djvu.txt

54.0B

points_djvu.txt

26 files

HTML

BACK

52.8K

AboutUs.html

46.0K

AdditionalMaterials.html

59.6K

Announcements.html

59.6K

zip_page.html

42.5K

AssignmentVisualization.html

45.0K

Community.html

66.8K

DiscussionForums.html

42.5K

Grades.html

42.5K

zip_page.html

44.8K

OptimizationTools.html

80.2K

ProgrammingAssignments.html

60.0K

QuickQuestions15.html

42.6K

SetCoverAssignment.html

41.6K

Socialize.html

44.6K

Surveys.html

79.1K

0_PostCourse_Survey_2015_Discrete_Optimization.html

78.7K

1_PreCourse_Survey_2015_Discrete_Optimization.html

49.4K

2_Exit_Survey__Please_complete_this_survey_ONLY_if_you_leave_the_course_before_the_end_of_the_session.html

60.4K

Syllabus.html

41.7K

Whatisthis.html

80.2K

assignment_home.html

41.8K

zip_page.html

41.8K

zip_page.html

41.9K

zip_page.html

58.6K

course_home.html

1.3M

entered_login.html

1 file

ITEM TILE

51 files

MPEG4

BACK

78.1M

01_Course_Motivation_-_Indiana_Jones_challenges_applications_20-49.mp4

42.2M

02_Course_Introduction_-_philosophy_design_grading_rubric_11-30.mp4

8.5M

03_Knapsack_1_-_intuition_2-29.mp4

24.0M

04_Knapsack_2_-_greedy_algorithms_7-10.mp4

25.2M

05_Knapsack_3_-_modeling_8-56.mp4

48.5M

06_Knapsack_4_-_dynamic_programming_17-58.mp4

49.3M

07_Knapsack_5_-_relaxation_branch_and_bound_14-49.mp4

45.9M

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41.mp4

28.7M

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06.mp4

97.6M

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16.mp4

91.1M

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20.mp4

51.8M

03_CP_3_-_reification_element_constraint_magic_series_stable_marriage_16-49.mp4

64.1M

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23.mp4

60.4M

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30.mp4

37.8M

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35.mp4

62.0M

07_CP_7_-_car_sequencing_dual_modeling_18-20.mp4

120.2M

08_CP_8_-_global_constraints_in_detail_knapsack_alldifferent_33-44.mp4

93.3M

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49.mp4

106.0M

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45.mp4

45.7M

01_LS_1_-_intuition_n-queens__13-57.mp4

55.3M

02_LS_2_-_swap_neighborhood_car_sequencing_magic_square_15-14.mp4

79.1M

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09.mp4

80.0M

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18.mp4

83.1M

05_LS_5_-_complex_neighborhoods_sports_scheduling_22-42.mp4

55.1M

06_LS_6_-_escaping_local_minima_connectivity__15-39.mp4

97.2M

07_LS_7_-_formalization_heuristics_meta-heuristics_introduction__22-46.mp4

79.5M

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54.mp4

115.8M

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37.mp4

84.3M

01_LP_1_-_intuition_convexity_geometric_view__24-14.mp4

50.3M

02_LP_2_-_algebraic_view_naive_algorithm__13-42.mp4

115.2M

03_LP_3_-_the_simplex_algorithm__32-22.mp4

76.1M

04_LP_4_-_matrix_notation_the_tableau_20-52.mp4

79.6M

05_LP_5_-_duality_derivation_22-00.mp4

60.4M

06_LP_6_-_duality_interpretation_and_uses___17-00.mp4

97.7M

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16.mp4

104.8M

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25.mp4

74.3M

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47.mp4

65.1M

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20.mp4

110.6M

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21.mp4

24.4M

01_Large_Neighborhood_Search_-_asymmetric_TSP_with_time_windows_8-42.mp4

81.5M

02_Column_Generation_-_branch_and_price_cutting_stock_23-04.mp4

133.5M

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13.mp4

39.3M

01_Getting_Started_13-42.mp4

47.4M

02_Introduction__Screen_Name_13-47.mp4

41.1M

03_Knapsack__External_Solver_12-13.mp4

21.4M

04_Graph_Coloring_6-23.mp4

36.5M

05_Traveling_Salesman_10-38.mp4

31.1M

06_Facility_Location_9-37.mp4

47.0M

07_Vehicle_Routing_14-19.mp4

20.5M

08_Optimization_Tools_6-00.mp4

31.4M

01_Set_Cover_9-11.mp4

51 files

OGG VIDEO

BACK

89.8M

01_Course_Motivation_-_Indiana_Jones_challenges_applications_20-49.ogv

49.6M

02_Course_Introduction_-_philosophy_design_grading_rubric_11-30.ogv

11.0M

03_Knapsack_1_-_intuition_2-29.ogv

31.0M

04_Knapsack_2_-_greedy_algorithms_7-10.ogv

37.6M

05_Knapsack_3_-_modeling_8-56.ogv

75.4M

06_Knapsack_4_-_dynamic_programming_17-58.ogv

63.8M

07_Knapsack_5_-_relaxation_branch_and_bound_14-49.ogv

63.2M

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41.ogv

42.5M

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06.ogv

117.5M

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16.ogv

113.5M

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20.ogv

72.0M

03_CP_3_-_reification_element_constraint_magic_series_stable_marriage_16-49.ogv

83.1M

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23.ogv

79.2M

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30.ogv

49.7M

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35.ogv

78.7M

07_CP_7_-_car_sequencing_dual_modeling_18-20.ogv

146.1M

08_CP_8_-_global_constraints_in_detail_knapsack_alldifferent_33-44.ogv

111.8M

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49.ogv

124.3M

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45.ogv

60.5M

01_LS_1_-_intuition_n-queens__13-57.ogv

66.0M

02_LS_2_-_swap_neighborhood_car_sequencing_magic_square_15-14.ogv

100.2M

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09.ogv

96.5M

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18.ogv

95.2M

05_LS_5_-_complex_neighborhoods_sports_scheduling_22-42.ogv

67.7M

06_LS_6_-_escaping_local_minima_connectivity__15-39.ogv

98.7M

07_LS_7_-_formalization_heuristics_meta-heuristics_introduction__22-46.ogv

81.8M

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54.ogv

114.8M

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37.ogv

102.7M

01_LP_1_-_intuition_convexity_geometric_view__24-14.ogv

59.3M

02_LP_2_-_algebraic_view_naive_algorithm__13-42.ogv

139.9M

03_LP_3_-_the_simplex_algorithm__32-22.ogv

90.2M

04_LP_4_-_matrix_notation_the_tableau_20-52.ogv

95.0M

05_LP_5_-_duality_derivation_22-00.ogv

73.5M

06_LP_6_-_duality_interpretation_and_uses___17-00.ogv

113.4M

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16.ogv

122.9M

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25.ogv

89.8M

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47.ogv

83.8M

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20.ogv

135.3M

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21.ogv

36.5M

01_Large_Neighborhood_Search_-_asymmetric_TSP_with_time_windows_8-42.ogv

99.7M

02_Column_Generation_-_branch_and_price_cutting_stock_23-04.ogv

161.0M

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13.ogv

57.6M

01_Getting_Started_13-42.ogv

59.8M

02_Introduction__Screen_Name_13-47.ogv

52.7M

03_Knapsack__External_Solver_12-13.ogv

27.5M

04_Graph_Coloring_6-23.ogv

46.0M

05_Traveling_Salesman_10-38.ogv

41.7M

06_Facility_Location_9-37.ogv

61.9M

07_Vehicle_Routing_14-19.ogv

25.9M

08_Optimization_Tools_6-00.ogv

39.8M

01_Set_Cover_9-11.ogv

42 files

PDF

BACK

869.8K

03_Knapsack_1_-_intuition_2-29.pdf

1.3M

04_Knapsack_2_-_greedy_algorithms_7-10.pdf

217.2K

05_Knapsack_3_-_modeling_8-56.pdf

675.3K

06_Knapsack_4_-_dynamic_programming_17-58.pdf

2.4M

07_Knapsack_5_-_relaxation_branch_and_bound_14-49.pdf

2.2M

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41.pdf

100.3K

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06.pdf

1.9M

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16.pdf

4.0M

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20.pdf

1.8M

03_CP_3_-_reification_element_constraint_magic_series_stable_marriage_16-49.pdf

4.5M

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23.pdf

889.7K

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30.pdf

1.6M

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35.pdf

1.4M

07_CP_7_-_car_sequencing_dual_modeling_18-20.pdf

1.6M

08_CP_8_-_global_constraints_in_detail_knapsack_alldifferent_33-44.pdf

3.0M

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49.pdf

1.5M

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45.pdf

11.8M

01_LS_1_-_intuition_n-queens__13-57.pdf

793.9K

02_LS_2_-_swap_neighborhood_car_sequencing_magic_square_15-14.pdf

1.8M

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09.pdf

1.8M

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18.pdf

654.0K

05_LS_5_-_complex_neighborhoods_sports_scheduling_22-42.pdf

1.3M

06_LS_6_-_escaping_local_minima_connectivity__15-39.pdf

3.6M

07_LS_7_-_formalization_heuristics_meta-heuristics_introduction__22-46.pdf

2.1M

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54.pdf

1.3M

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37.pdf

2.6M

01_LP_1_-_intuition_convexity_geometric_view__24-14.pdf

1.2M

02_LP_2_-_algebraic_view_naive_algorithm__13-42.pdf

1.6M

03_LP_3_-_the_simplex_algorithm__32-22.pdf

1.5M

04_LP_4_-_matrix_notation_the_tableau_20-52.pdf

1.1M

05_LP_5_-_duality_derivation_22-00.pdf

1.2M

06_LP_6_-_duality_interpretation_and_uses___17-00.pdf

2.1M

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16.pdf

2.7M

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25.pdf

2.3M

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47.pdf

3.4M

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20.pdf

3.7M

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21.pdf

966.7K

01_Large_Neighborhood_Search_-_asymmetric_TSP_with_time_windows_8-42.pdf

2.4M

02_Column_Generation_-_branch_and_price_cutting_stock_23-04.pdf

2.3M

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13.pdf

353.7K

01_Getting_Started_13-42.pdf

11.8K

points.pdf

34 files

SINGLE PAGE PROCESSED JP2 ZIP

BACK

4.6M

03_Knapsack_1_-_intuition_2-29_jp2.zip

12.7M

04_Knapsack_2_-_greedy_algorithms_7-10_jp2.zip

2.7M

05_Knapsack_3_-_modeling_8-56_jp2.zip

4.1M

06_Knapsack_4_-_dynamic_programming_17-58_jp2.zip

13.6M

07_Knapsack_5_-_relaxation_branch_and_bound_14-49_jp2.zip

14.5M

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41_jp2.zip

4.9M

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06_jp2.zip

33.0M

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16_jp2.zip

71.9M

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20_jp2.zip

43.2M

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23_jp2.zip

14.2M

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30_jp2.zip

25.1M

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35_jp2.zip

35.9M

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49_jp2.zip

30.5M

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45_jp2.zip

54.5M

01_LS_1_-_intuition_n-queens__13-57_jp2.zip

40.7M

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09_jp2.zip

28.9M

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18_jp2.zip

36.5M

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54_jp2.zip

33.1M

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37_jp2.zip

45.1M

01_LP_1_-_intuition_convexity_geometric_view__24-14_jp2.zip

12.9M

02_LP_2_-_algebraic_view_naive_algorithm__13-42_jp2.zip

28.0M

03_LP_3_-_the_simplex_algorithm__32-22_jp2.zip

16.9M

04_LP_4_-_matrix_notation_the_tableau_20-52_jp2.zip

6.1M

05_LP_5_-_duality_derivation_22-00_jp2.zip

14.5M

06_LP_6_-_duality_interpretation_and_uses___17-00_jp2.zip

38.8M

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16_jp2.zip

45.6M

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25_jp2.zip

27.9M

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47_jp2.zip

36.8M

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20_jp2.zip

14.1M

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21_jp2.zip

36.1M

02_Column_Generation_-_branch_and_price_cutting_stock_23-04_jp2.zip

35.6M

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13_jp2.zip

6.6M

01_Getting_Started_13-42_jp2.zip

118.2K

points_jp2.zip

51 files

SUBRIP

BACK

32.7K

01_Course_Motivation_-_Indiana_Jones_challenges_applications_20-49.srt

19.9K

02_Course_Introduction_-_philosophy_design_grading_rubric_11-30.srt

4.3K

03_Knapsack_1_-_intuition_2-29.srt

13.4K

04_Knapsack_2_-_greedy_algorithms_7-10.srt

17.2K

05_Knapsack_3_-_modeling_8-56.srt

33.1K

06_Knapsack_4_-_dynamic_programming_17-58.srt

24.5K

07_Knapsack_5_-_relaxation_branch_and_bound_14-49.srt

28.3K

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41.srt

20.2K

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06.srt

50.1K

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16.srt

45.5K

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20.srt

27.3K

03_CP_3_-_reification_element_constraint_magic_series_stable_marriage_16-49.srt

34.9K

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23.srt

31.4K

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30.srt

19.1K

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35.srt

33.1K

07_CP_7_-_car_sequencing_dual_modeling_18-20.srt

59.8K

08_CP_8_-_global_constraints_in_detail_knapsack_alldifferent_33-44.srt

45.7K

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49.srt

48.8K

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45.srt

23.6K

01_LS_1_-_intuition_n-queens__13-57.srt

24.7K

02_LS_2_-_swap_neighborhood_car_sequencing_magic_square_15-14.srt

39.1K

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09.srt

36.3K

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18.srt

36.9K

05_LS_5_-_complex_neighborhoods_sports_scheduling_22-42.srt

25.6K

06_LS_6_-_escaping_local_minima_connectivity__15-39.srt

42.6K

07_LS_7_-_formalization_heuristics_meta-heuristics_introduction__22-46.srt

36.8K

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54.srt

47.8K

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37.srt

40.6K

01_LP_1_-_intuition_convexity_geometric_view__24-14.srt

24.5K

02_LP_2_-_algebraic_view_naive_algorithm__13-42.srt

55.1K

03_LP_3_-_the_simplex_algorithm__32-22.srt

34.3K

04_LP_4_-_matrix_notation_the_tableau_20-52.srt

38.1K

05_LP_5_-_duality_derivation_22-00.srt

28.6K

06_LP_6_-_duality_interpretation_and_uses___17-00.srt

46.9K

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16.srt

50.3K

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25.srt

35.5K

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47.srt

34.8K

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20.srt

53.1K

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21.srt

17.1K

01_Large_Neighborhood_Search_-_asymmetric_TSP_with_time_windows_8-42.srt

40.7K

02_Column_Generation_-_branch_and_price_cutting_stock_23-04.srt

62.9K

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13.srt

27.3K

01_Getting_Started_13-42.srt

23.6K

02_Introduction__Screen_Name_13-47.srt

21.3K

03_Knapsack__External_Solver_12-13.srt

10.8K

04_Graph_Coloring_6-23.srt

18.9K

05_Traveling_Salesman_10-38.srt

18.1K

06_Facility_Location_9-37.srt

25.2K

07_Vehicle_Routing_14-19.srt

10.6K

08_Optimization_Tools_6-00.srt

16.8K

01_Set_Cover_9-11.srt

75 files

TEXT

BACK

21.5K

01_Course_Motivation_-_Indiana_Jones_challenges_applications_20-49.txt

13.1K

02_Course_Introduction_-_philosophy_design_grading_rubric_11-30.txt

2.6K

03_Knapsack_1_-_intuition_2-29.txt

8.0K

04_Knapsack_2_-_greedy_algorithms_7-10.txt

10.2K

05_Knapsack_3_-_modeling_8-56.txt

19.3K

06_Knapsack_4_-_dynamic_programming_17-58.txt

14.7K

07_Knapsack_5_-_relaxation_branch_and_bound_14-49.txt

16.6K

08_Knapsack_6_-_search_strategies_depth_first_best_first_least_discrepancy_14-41.txt

12.1K

09_Exploring_the_Material_-__open_course_design_optimization_landscape_picking_your_adventure_10-06.txt

32.5K

01_CP_1_-_intuition_computational_paradigm_map_coloring_n-queens_27-16.txt

29.4K

02_CP_2_-_propagation_arithmetic_constraints_send_moremoney_26-20.txt

17.6K

03_CP_3_-_reification_element_constraint_magic_series_stable_marriage_16-49.txt

22.3K

04_CP_4_-_global_constraint_intuition_table_constraint_sudoku__19-23.txt

20.6K

05_CP_5_-_symmetry_breaking_BIBD_scene_allocation_18-30.txt

12.6K

06_CP_6_-_redundant_constraints_magic_series_market_split_11-35.txt

21.3K

07_CP_7_-_car_sequencing_dual_modeling_18-20.txt

37.8K

08_CP_8_-_global_constraints_in_detail_knapsack_alldifferent_33-44.txt

29.9K

09_CP_9_-_search_first-fail_euler_knight_ESDD_24-49.txt

32.4K

10_CP_10_-_value-variable_labeling_domain_splitting_symmetry_breaking_in_search_28-45.txt

15.4K

01_LS_1_-_intuition_n-queens__13-57.txt

16.2K

02_LS_2_-_swap_neighborhood_car_sequencing_magic_square_15-14.txt

25.2K

03_LS_3_-_optimization_warehouse_location_traveling_salesman_2-opt_k-opt___23-09.txt

24.0K

04_LS_4_-_optimality_vs_feasibility_graph_coloring__22-18.txt

24.4K

05_LS_5_-_complex_neighborhoods_sports_scheduling_22-42.txt

17.0K

06_LS_6_-_escaping_local_minima_connectivity__15-39.txt

27.4K

07_LS_7_-_formalization_heuristics_meta-heuristics_introduction__22-46.txt

23.4K

08_LS_8_-_iterated_location_search_metropolis_heuristic_simulated_annealing_tabu_search_intuition_18-54.txt

31.1K

09_LS_9_-_tabu_search_formalized_aspiration_car_sequencing_n-queens_26-37.txt

25.7K

01_LP_1_-_intuition_convexity_geometric_view__24-14.txt

15.6K

02_LP_2_-_algebraic_view_naive_algorithm__13-42.txt

36.0K

03_LP_3_-_the_simplex_algorithm__32-22.txt

22.2K

04_LP_4_-_matrix_notation_the_tableau_20-52.txt

24.1K

05_LP_5_-_duality_derivation_22-00.txt

18.6K

06_LP_6_-_duality_interpretation_and_uses___17-00.txt

30.0K

07_MIP_1_-_intuition_relaxation_branch_and_bound_knapsack_warehouse_location__26-16.txt

32.2K

08_MIP_2_-_modeling_big-M_warehouse_location_graph_coloring__28-25.txt

23.2K

09_MIP_3_-_cutting_planes_Gomory_cuts_20-47.txt

21.9K

10_MIP_4_-_convex_hull_polyhedral_cuts_warehouse_location_node_packing_graph_coloring__19-20.txt

34.1K

11_MIP_5_-_cover_cuts_branch_and_cut_seven_bridges_traveling_salesman___31-21.txt

9.7K

01_Large_Neighborhood_Search_-_asymmetric_TSP_with_time_windows_8-42.txt

26.4K

02_Column_Generation_-_branch_and_price_cutting_stock_23-04.txt

41.5K

03_Scheduling_-_jobshop_disjunctive_global_constraint_37-13.txt

16.1K

01_Getting_Started_13-42.txt

15.4K

02_Introduction__Screen_Name_13-47.txt

13.7K

03_Knapsack__External_Solver_12-13.txt

7.1K

04_Graph_Coloring_6-23.txt

12.1K

05_Traveling_Salesman_10-38.txt

10.4K

06_Facility_Location_9-37.txt

16.4K

07_Vehicle_Routing_14-19.txt

6.9K

08_Optimization_Tools_6-00.txt

9.8K

01_Set_Cover_9-11.txt

2.4K

links.txt

3.5K

links.txt

4.3K

links.txt

2.2K

links.txt

3.1K

links.txt

8.2K

links.txt

2.0K

links.txt

2.7K

links.txt

6.5K

links.txt

1.8K

links.txt

2.2K

links.txt

2.0K

links.txt

1.9K

links.txt

1.9K

links.txt

1.9K

links.txt

3.3K

links.txt

2.1K

links.txt

2.0K

links.txt

2.0K

links.txt

2.0K

links.txt

2.0K

links.txt

2.0K

links.txt

2.0K

links.txt

2.0K

links.txt

1 file

TORRENT

14 files

ZIP

BACK

92.0K

02_Introduction__Screen_Name_13-47.zip

227.9K

03_Knapsack__External_Solver_12-13.zip

3.6M

04_Graph_Coloring_6-23.zip

1.0M

05_Traveling_Salesman_10-38.zip

937.3K

06_Facility_Location_9-37.zip

277.5K

07_Vehicle_Routing_14-19.zip

49.0M

01_Set_Cover_9-11.zip

3.6M

coloring.zip

937.3K

facility.zip

282.0B

tsp.zip

277.5K

vrp.zip

227.9K

knapsack.zip

92.0K

screenname.zip

49.0M

setcover.zip

743 Files
7 Original

SHOW ALL

IN COLLECTIONS

Academic Torrents

The Dataset Collection

Uploaded by arkiver2 on August 12, 2018

[Coursera] Discrete Optimization (The University of Melbourne) (optimization)

Movies Preview

Flag this item for

[Coursera] Discrete Optimization (The University of Melbourne) (optimization)

plus-circle Add Review comment Reviews

DOWNLOAD OPTIONS

IN COLLECTIONS

SIMILAR ITEMS (based on metadata)

plus-circle Add Review

comment
Reviews