Faculty of Science and Engineering

Back to List

PRI300XF(情報学基礎 / Principles of informatics 300)
Combinatorial Optimization

Kenjiro TAKAZAWA, Hiroyuki GOTO

Class code etc
Faculty/Graduate school Faculty of Science and Engineering
Attached documents
Year 2024
Class code H6545
Previous Class code
Previous Class title
Term 春学期授業/Spring
Day/Period 金2/Fri.2
Class Type
Campus 小金井
Classroom name 小西館‐W003PC
Grade 3年
Credit(s)
Notes
Open Program
Open Program (Notes)
Global Open Program
Interdepartmental class taking system for Academic Achievers
Interdepartmental class taking system for Academic Achievers (Notes)
Class taught by instructors with practical experience
SDGs CP
Urban Design CP
Diversity CP
Learning for the Future CP
Carbon Neutral CP
Chiyoda Campus Consortium
Category 経営システム工学科
学科専門科目

Show all

Hide All

Outline (in English)

[Course outline]
In mathematical analyses, optimization problems are roughly divided into continuous and discrete optimization contexts. This class is concerned with the latter type, particularly focusing on a type called "combinatorial optimization".
In the theoretical part, the basis of complexity theory and approaches to solving hard problems are presented.
In the implementation part, problems familiar in everyday life such as packing, SUDOKU puzzle, and scheduling, are taken up to solve these using a general-purpose solver.

[Learning objectives]
Upon completion, students should be able to:
1. analyze the complexity of problems.
2. formulate problems mathematically.
3. describe problems for general-purpose solvers.
4. solve large-scale problems with a general-purpose solver.

[Learning activities outside of classroom]
1. Students should spend four hours for preparation and review.
2. An assignment will be given on completion of each topic.

[Grading criteria]
The final grading will be conducted based on:
Theoretical part: assignment (70%), class contribution (30%)
Implementation part: assignment (70%), class contribution (30%)

Default language used in class

日本語 / Japanese