[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"292dd1ef1f289a77cb76b508dfc0cd965c6bbd578de7ed4ed3e07b293172aa30","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"292dd1ef1f289a77cb76b508dfc0cd965c6bbd578de7ed4ed3e07b293172aa30","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"186b926538179aafdf597c28f868978fc15d4981d29cf316971d0e656d15489d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"186b926538179aafdf597c28f868978fc15d4981d29cf316971d0e656d15489d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"4b07e4667c1e3491d613467335b12415cb458e822383813549045eb515a24348","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"3ffcd3c8f0620ae71fbd17b8205e4a7495ec88ff9540c4619e6f688d94523edd","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"c5b9c54151db43c2c8dde8a44c4456dd7cd0427bf7879f68371d2de792057bd2","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"46fa0a3ebad22ec988d4eca9e0a62f15dd3bb068c10ea7c0b40b28b8cc84fd28","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"f0c85b139b2590e2fdd0a2ea2c30583d26b37e5e3a781cea7a9e52cdbaacebf4","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"f1ac27178617f130079cf49ec6f16940153f669a4266647ed31d64ece5e65608","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"7d80a83da43f5c0818667c5294de55372d1385ba4d6039779ddb86fb77088102","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"5ca8f2c52108ea6a7be888158640a4fc7fb57aa006b118d4155d821bdea3b200","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"b7ca18d3a650ead47245e250c4aab83ade4b4bf6d70f4cbcdd7fa38a0184603a","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"ee253069280afdc088daacd6901cb89f6f085090b185b61ae67122d8f2b5ad59","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"c8cd27a4cd572e664d6b6457a616396ae75503b9ac56431a09344157e8b0f489","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"888ea67f60e253b77f9824cd6f3fb2b2f01a11332afa3e13a27ac66d555f27f2","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"0712ab0762139fc829766ff65f501c4ea0e4a21df4df2da478caaa67d47ed416","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"c6400540dd33e5e8cef80617863e8be806f99f79a9c44cb0b5af169b1ba7c7a5","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"eea900e5d9e51dcf8f784415dbfd2a0769ccfa941d6b53671351820603e14346","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"a00a114d48bba06900e37481e82d528472ad533851767eaba1bc53ccc3348442","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"97875dfbd209d2b1af976345e25dc282fce059983006c5478545b7adaf5ac82e","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"1ec6fc941cdd528bbd332d42b21d8de1835a54fac09361aeb9271cda1b011d9e","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"8e89f2ffed44b9d0e26bb031810bc7dbcd6565da217498971a50c72b49077453","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"2985ee299179fd27f6d0701c9f2d2b9a3bb9196a20e5c60be746f47fb20e9fc4","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"c775c3908e3c6d54a5490cc16bdb8a31a0960d3a7b922969ac214b195aecb173","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"0db19bd8d2c4966924aade4e4f2fc81e0c03a9b37ae28f264868dceb5c6a58e2","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"00c7dff610ecd6d2ddef4653a3831ded7cf20af57951ab8d24f7de3c0833dac8","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"6e29a5e20e4479c9956fb5f43e77e63d824e1ab31f7a7f5425a833da02fb25a5","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"c7fa0bbc114b06597d5f6781eb41dd776387e79e15b3371cc586a5387a19df5c","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"12029f4d0731b68e59f565e12cc7bfedc9f1f9634b8d7fd88b9f31e892b93abf","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"29cc78269d2991dac81024068420ec4e1e45757bb43533f6c00c70b0ad4b35ed","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"ca84edba850df1820dfa713a062d5b93de5b9b75d9b094afec114699cce86149","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"1f9b4e6bbee1f2be318be94f3aa3950b016c42ea4737367bbd1822df318eb201","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"3940b4c079059bc048ebd51fa0691346c97733b9f946182c7a1f888cb3a009e9","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"d31cfad610bc4db6211f978a1bc0dd352e3bb1737f550bc824eb3d66b6d33a0e","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"b2e7ce8ae00f8b4a06b9043963c88457a22cc47622888dc8823f6cf34493a88c","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"e4cebe040c4e96dea996bfbca7e97b6d945cfb3c3a35d5961dcb9aaca515e482","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"9c964943df3a9aa0ba64b33f2eebe2cbe69269ca724731f2eedb4c987ac73f2b","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"dfb0641340228552e22a4353f0d3f15dafbc78ec3675206a05845bdd14a14c6e","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"9632d5ff5cf35864d05412f299ec5f65ac42e7f3cc3a7c070e7aaf0c95e45f01","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"6ad2f6fdad6bd44de90ecd7ec2b7f903dee247aad6dc6d0af4a2cffbd4325aef","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"20af2ae87be7efd565b546a87943afa3f25fcfa639fe4ef4867f9d1c4d1ff937","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"3fb291d5e3c002fd8cdb5fc5b8d4a02189d1ddcb861d4460dfad5fbf5df84e68","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"43745ba330de0e8cc66c7e9dbcec0cfa8281a0ffab231480221c7b0a3e1ff86c","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"eb83399cd389853f87ecad030b6dd00fe6ae1f853969af340870cbccd1579350","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"f0f2162f737d70038ccf21894d8f452ba745706a72fb281b29986efea34ef593","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"f5465c89fbcd75ecc7bf18fb9176a5e6b9e137f091f6b5c0ec80ab4195c37f1d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"d4f008e1e3b8635a7938c5a75b14f6d59895ac8f4313cc7c7dd1253e60cde9a8","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"a4f78cb2267fb79553cdf1b76f256f2de3a5ccfd5042774c3ae1d0a9e49c8a5a","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"5b6d03d93fed19d5f725d7beb4b4e5969dcfae27b5e2d403254d89e476472ed6","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"9ccdea15228df1dfc951e2ccb916901eb8ef3dfdbda010c0f4f42608d0551586","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"4d4cb10ff7fd2a7b7016e4892cb7370bfbfc316a933ca7039cbf83141532db70","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"3781fe6a2685cdf707e51599e496c718550c4a531469e8c4519164ebef1bf700","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"edea944f3ac8efd949eb18d8532a6cbfb207c916ac543f927a4fa939b4f70594","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"8830071194e54cb267a4f969ba731104e1e6062512822a1b08491f68fc184ba0","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"1b085136b4d489863739be77affd64fae0905d859e31cc2c8ae63b484db9a98d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"945d25357cb903ef231369709b1b2af75dc1dda98713201d5ac2b6cab43870ed","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"fa768ae9c796b0f1183276f2252f88cc69ae427fc0010b80be18e259c1354f44","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"50e5c8cfabe150c51436ebf5b8b5da5a72eefc1ea363c8a97de4efa9f0e7baa5","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"640532ea90fd53b22f9e482017216900148e08a26b921b8a39d73a649e55313a","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"ac1ef0fc2435d5ba39a4a1ea6d3621f732bc732711e73c13eaeec25ed682f43f","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"bbb4629e0fa44cbd341254081af2b6fbf15d96e7965d8a5d7bfc4ef4097e2d76","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"b5898624c1cdb0d454c3f191464e65f524ba0603728adc43595231f22765d945","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"e56cedd36ba1637d77fa0aacd05b384f011b145306b7441f623d96ce5136a1ea","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"5bd568a4c1568aae3fbe9e8b61483db76e133b15051bbf531d05e764970a2fc9","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"9feb8d56f3f616b62df1fc30a2323ca6686f137583376fb5b9f1d5b10c2bc5f1","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"f5465c89fbcd75ecc7bf18fb9176a5e6b9e137f091f6b5c0ec80ab4195c37f1d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"68acdf63786935ddbc12dbe403272dc040062369bc28555aa13a7a5146590302","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"878b08bec154a48c9beea759695c5d650a3529c303a068d14e1246e34b2edb13","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"0f586e80f354ba816b2d128d68ea502b60852653b8c2e6f40ded74565880adb3","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"b10351893a2b2b5dfba8fac14e71ed77693fa03182fdbd802e0e9c65d8cbbcfd","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"58a4ef7e34d93a752529bc59a32f5329a0b3fa034e87fa974f2737d247a67f30","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"fd726dce4112776de4fc347e8025a1426de448a2ac514c899707dcdb550e96c7","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"0c7880212e1700d831758eb693c07f10865a66e6be7ed794a618229c1d710c28","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"e10e110ec9a71b52a7350844552b67cb6b7fe8b021e372f4301d782790b21c88","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"ac0e98be9af69299ee19e7e79fd945b270d623b7493c37f6c69fa4fe3fa8c892","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"c704464fe0657335588a0585ab46081d2ec20a11255d6059de280ea63a112131","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"a37a52b24a66d545092d55e490daecfa679d1de09698fbc10b9bd116a17152c0","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"2945d37c5fa0209e250c56b6d1db20d0c0b3261a6204d81c4c6bc33e979cc9e1","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"2691276ef8f6249f5f0bfeaf187e18e4afea70e332d7ee2f475135f59766e284","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"a521eac2deac2f5e28e194cfabf1c6754a8df9fc6d98132af24272454d852c1d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"4271b6d39c3682ce68cc26bbab61b17d18e9d23e99a6ab4fda233b2366f3e4ce","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"73d75595d225f3703d6caac9b6eb2aa445499a4079c89cf858ea18c799216c21","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"06c34bfc6222ea149fdf163f570a09ae8c87534edafb2e54afe0517e48d3800d","course_id":"COMPSCI/ISYE/MATH 728","course_uid":"course_a7f061aae87dfef4b924b9a9","catalog_version_id":"a12db28348a9d9d823f1597c025113765a78f0d31cc4aeae40835a8b2b43c576","course_number":728,"subjects":["COMPSCI","ISYE","MATH"],"title":"INTEGER OPTIMIZATION","description":"Introduces optimization problems over integers, and surveys the theory behind the algorithms used in state-of-the-art methods for solving such problems. Special attention is given to the polyhedral formulations of these problems, and to their algebraic and geometric properties. Applicability of Integer Optimization is highlighted with applications in combinatorial optimization. Key topics include: formulations, relaxations, polyhedral theory, cutting planes, decomposition, enumeration.  Students are strongly encouraged to have knowledge of Linear Programming  (e.g.,MATH/​COMP SCI/​I SY E/​STAT  525), including algorithms, duality and polyhedral theory.","requirements_text":"Graduate/professional standing"}]