[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"99b04026aa699e78242128f5a17313962264e71cf451c6a41384c6d61990ea94","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"99b04026aa699e78242128f5a17313962264e71cf451c6a41384c6d61990ea94","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"20261014T203208-0851c9a1","semester":"1274","observed_at":"2026-10-14 17:50:09.728220+00:00","record_version_id":"e9b65264aeee89b99b6d82c471bd043c76518d534d094af567adcbadf4476883","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"18c48a8cd38ecd61f44767fe1d00d4034b8c03d94faa4b306ab61a3a9bbf492a","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"MATH 320,340,341,345,375, graduate/professional standing, or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Identify and use the structural properties of combinatorial optimization problems\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Apply algorithms for the solution -exact or approximate- of a combinatorial optimization problem\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:52:01.938346+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/comp_sci/\",\"term\":null,\"text\":\"Explain why the algorithms studied are correct and understand their running time\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Identify and use the structural properties of combinatorial optimization problems\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Apply algorithms for the solution -exact or approximate- of a combinatorial optimization problem\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:40.213374+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/i_sy_e/\",\"term\":null,\"text\":\"Explain why the algorithms studied are correct and understand their running time\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Identify and use the structural properties of combinatorial optimization problems\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Apply algorithms for the solution -exact or approximate- of a combinatorial optimization problem\"},{\"catalog_year\":\"2026-2027\",\"observed_at\":\"2026-10-14T17:51:41.022582+00:00\",\"source\":\"catalog\",\"source_url\":\"https://guide.wisc.edu/courses/math/\",\"term\":null,\"text\":\"Explain why the algorithms studied are correct and understand their running time\"}]"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"13b65fecab776cab40062dc59cd0ba8debf549bc312f13f34c279ffce42ff465","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"13b65fecab776cab40062dc59cd0ba8debf549bc312f13f34c279ffce42ff465","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"4fb8240f6ee37881346c87f9c5c279a46b81ca4635e94bb220b719e1b00c888e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"9354fbf1d880de2b386b524e85094509f73379088dc9a5a4662c66ea4e1f858f","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"0f35e49d320cb0195a2a946fd4a2f128793738d071df5af6c494643364eb553c","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"592701b1a4d1d3375c1b52df17cba05ed309f44e29dbc7ddcbf0c1f74111cb36","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"d7ed4f11e01d3dadf44fb8164bc89c828824e550470311d5f5e7f7893cb50f58","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"2dcc983f18e0c4d09e6c9ec979fce28fbff82341f29dbbdb02204acbf2550d72","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"b1916611d0ad0e608dd05fc2231d7e6ebafae052f96a322db8abe83388e1fc0c","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"60da94f69221710a78fbec6b2434e3d6555593ace1d0e784772031ecb633d8f9","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"b26caf3e1e0b9f3bc8814a0ba70e16fbd2a6e2e88c6a4bdf8db1d405c94f6ed2","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"5916a3cfad206a6ec840de3e967a26c810a9434a5b84d3d6deae79595d62d11c","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"b5686fb3ed527834721b24770e81e6358904676846626a4174912c0bc5b90b0b","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"9e832672c7dea3cfaf4792497f5c14694104718916edf927bda6870ae2361425","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"f8b634f54f3063ef7b48647117108452c6ddc9dec18bd7123cc1c7e1c6a02b8a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"4c21f3ea609dc1933eb391667fdb6c1c9991f2c263de0104be4ffddd8cdca0a9","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"81d5313a4dfa8d4500d480693b9abaa324d05d7e39890c699bab6c2ea8a71944","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"db75fadc6bae1ce5b95ed46819e4c72118ee6ff7ad76b42a8ba14cb6453cc419","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"2afb822ba9b77d487a315955f2dd503823abdaf2b27394822dcb5cd9ee6a5a6b","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"17d84e615e33087d2eba1e5c643ccb5a976f0f321ea04a712917464d76958ba0","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"ff0c01a626b73cfcfe65a9af4a0c6f55341a68776a726181a929e526a325569d","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"6044b348dcbebe0b147d84f5a9b3230368b221f085a81d9e3f065ab06d0cbcef","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"346bfbccfe44b8afb407019aa34de646ed470954a909e0d61ceb5abc7a97a8c9","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"47098072a4e8639b7cf53d6a8a1ea0aa5fdda754ad2ae69225218d48c2c15b27","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"2ba25d29d36c4093cae6849a5bdf7f3b4d34677b98497e368ae55656c5ee60c1","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"49d4e4b67cb55eafdfd7699a3fa0f71a26642776c653d906b643c1fabbdd8e62","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"0dc1794c187888429f4169e485b639a87fadbd5df530ab93eae23caacec2392a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"6d290ce49660c647dc945d761be75cd18f11f4a147283d8aa75283c3ded6fcfb","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"91473f06f7d5be41e0592747a9747e4d8ac67f09f0fa3dc11274adce1f9f5021","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"795ce707eabbad69fdba7b9aa2be69cfb9eedc6adcbed84b992b1ad064b4506e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"4f2ba8d5f6c01b2f2cd4576a13d1914305d42b5f1f9b77d0b3bc193652946c9a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"e4c52015c8252d83a7037cb0d826e4c1b500b1dae6c26a8de6cd2561f9a7d95b","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"dd1fc5a17912fd14b3a5364653894f63bdc243dddb4dc94a4930b0b73e20d8b9","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"95063079897d3c1d4b583b22b64aece1dc003f62660e9e98c9b0dada1320c0f0","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"c8dd63a89301fc0bcb7da7b2080bd9492374f2f9776a04495fe85dead7d6085e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"721019f83658557c0b01ab5799d8244c8cccfdf9c1b03d2072a2283c1ddad7bc","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"d07b66a4549760394163611d69939f4ca216051940eab11300e494ead353f583","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"5ea07a6cc50ea1a3c00bffc5d27ba9f47d47adbbca6776e3a46b6297e4eec3f9","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"4d269cf091e1d7b244a98bbdb053cd0c62301039d4a1364eeac29d7808e3a502","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"9b3efd7c693af8a231f1a59a1c3cfc138339b14cd46bb168f4e87b1708fa81b8","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"cadd27d6556b94baca345dd016191bbec98f8eb256a067eb30aaabf908c0b079","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"b1d2c3db3cf4565ec7a1f0a628bc57b32c9fab3bbd19ca92819e7f18cbf383bd","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"6e27e492c72542817392127af4bd524a515b26b99b3d4d91cde1dd783e56fa80","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"ef8fe00c496202aea1f3ee949b8ed0ea85feaac5e6465dcc61c5cacf5b257ce1","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"41eb332683a15a46fe6df22995146bb07acc7e54c548a7d4ec48adb8b2044b61","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"ef786eef42b578db3a8fccede9b40217cab64c4d86191c472211bdd386608f88","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"c82946cf373a7af40d031067588fb896265666854b6d74f54a8fb81034670973","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"ba134215ee003de21dcd6164d2a353c2aa6f00c0f0025ddb78dcf4c09a39bbf3","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"d1f8b177efbbebe4090066da27bcd31ebee896af6104e312a6810fe3b03d06a6","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"92a26b1ab37a0b601789e02b6fc0ba094f109f12fdb65b4779582b2ef2af15a4","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"f20452786a6e98dc3f81f55e076f4a6b2f4abee521c3bc0eac40f64f5a551c9b","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"cded878dd9ff4c621370bec04447e7f0ea9c888597b4812e57412b32fdeff87f","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"0a8ea296bb15cbf2b93ebd691ab8829516e993cf036a7a0e10a63b982e83e3e6","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"c2be96fd018e4bd2e9ad8f7ef3021be59f293ba3964821818ea073570c484a42","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"b1036a1630ab287a4cd52ca9b3730ee3f01271483d0a1cfe61a13b727bd49e65","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"d97973f54536a0781f8d0aef44b0dc1aed6b7dddb8eca3008849e66cf307c547","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"f896be6afa111b62ede730c69c8f09e7fffe97af494b483daaa1b79bd8f389eb","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"e27e1078961b00a2a1878f0f367f36b13fc0c8dc89dac780cf5acb37af9f2644","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"599d04105b108d4ca1b9e438df888d9ab57cf82d3e049b6659bfb98a75b61c6a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"01118b9583e7300830621c688549ea64de2c6396dda75844813491323cb0bf8a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"c05777e57d741db0f465879deea647fc55e87e77d14bb4a6a0726e02ef846a48","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"c84ddc91268bcc3fcbeb2ea44bdb6ab928627ea30293d15603f571c387606965","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"3705401927aa04349d7cf294d112f62bb37097d20fde5f4103b6a38e2a2cbd29","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"cf5aeb35ba63e2a29f7a827302b24827884ead336b82a9625eecfc9daa9592eb","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"41eb332683a15a46fe6df22995146bb07acc7e54c548a7d4ec48adb8b2044b61","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"0385e4d18afc665dde300689202c045867cafdca763a668433c373daabefa32f","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"208456d04c2f0bff494aecb50a64039a55cb6da263096c3f97db846ad6db566e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"65f48c8e3820e2fe270a10854a6828aa9a9ac9d3a66816a88f5a81acfa1c231e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"bc099154e10395ba68e1f1c103445f369155430ba1c9d5b40311ed813589d02e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"5b131d9c34f06031bfa39af5c180ca5bf526ee3e180010f95458f5ceccc6a3f0","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"1914647736460a55bd4c37d42dc1baa8b1c18499ed0332a7919dc767d5dc6f9e","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"96290d693914a9d276767491bc5d04f544ca1120a11c063a5693662d5290aa61","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"e077fbb9ff9a10aa685b235d8040395011fbad9abc9e4a18a05ba98857180242","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"2e38440a73461df8f80ad1ac921d3712f8d504911e607d4e5558949199ab42e1","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"117f58165501c8fd74fc41a88701e03540da095baaa153464b2520c5f43d6c97","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"84acc8616a69d24c9dcc66b53008ccd672f8fee68020965897f7feaf1ac5829f","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"353e0e25ccd19ead2ace289ffb1ad76e9a993dbd0227e9af3d3edcf45ece12fd","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"b01569c6c3b428df1b42a1a9e9653b09a56d50aee65e09028c88dbcbe5e2e865","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"cdcc1ec4f1e698c5d85413edc1297c745558df6d4bee31ab1d276bdff3355dc7","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"504e44c7bbef35410d2db10a518c39d9ad965c8bc1d13abea8b211563d0d478a","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"b710e985ffc204f1bb414f0d40f9f89e676a85ea4f64913ac122d67e6a07d179","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"a118d96729cc2278338165ca2465ca571063ce4bb04609ac10d92e4512808730","course_id":"COMPSCI/ISYE/MATH 425","course_uid":"course_5aa742b184448a57a07564c5","catalog_version_id":"77a6b3c5d5a40944c29c9b573fa634e4e881d40580df21fb224b3d459cff57fe","course_number":425,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTRODUCTION TO COMBINATORIAL OPTIMIZATION","description":"Focuses on optimization problems over discrete structures, such as shortest paths, spanning trees, flows, matchings, and the traveling salesman problem. We will investigate structural properties of these problems, and we will study both exact methods for their solution, and approximation algorithms.","requirements_text":"(MATH 320,340,341, or375) or graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program","official_learning_outcomes_json":"[]"}]