[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525,I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"91374c1f556dd5be21764f26e7008624f42b4b71c3b4b0c5ca886e2480866c1a","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525,I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"e6f9267cd96bcf09ed2215feb91945040cad02e642cefe4c3b7db552b2732eee","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"e6f9267cd96bcf09ed2215feb91945040cad02e642cefe4c3b7db552b2732eee","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"bd23158d5bec1322221ca450190d6484a49ef84d9599b44d3dd8c943af3f94af","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"84ed83d10edc6a39248f2cc5784bf1257762cf13da36b1208e338b2208083baf","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"0e04bb0200f789314d51347b51c8d6125124a548aea6b30f77e6e2eaec9b8aee","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"de52007b28982fc80291fad5a285fb960eca1b7d3c06bcd2a16d4cf6220175a6","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"28987a505b2b313b18e84a6d00ca476252ad73f7a4e18c02c3db1c4b1ea02e23","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"8da15e3ff68083e26b4ef1c11266a32dfcece9e005906fcf0adc215629e6ebf1","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"7c55ff151de983c8f20dc43d810dd04c5a00a0c1e6c6046997606db7cba2f2d8","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525,I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"aae10dc4b9bd0a8be5935963602c7beb4e662c5693d082a094c9d9f007874546","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"7a8b3ee231363d6c84776dae74a6df9bba8066410b35d0c1499b2d4fa284e21e","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"e635f254911ecc1cd8685aa85f4dcc4d722c0329d09771779aad216f716177a9","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"52448a1c442d496825964ef5b0119e4f47613adb24bc17ca2436ca55c1c567e3","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"40098f18d8eb08db24e0acbe7399043f858a89c37f205bf41c7ba0a61973fc28","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"e759fda02e75110d919b0adbcfc3554f6d28d3f12ba553aa42e74270f57afc06","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"5b864a8efaaa98dee42964bbcd48fe839524c341e175cb344cc1e7606e8f2dd5","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"d6e3b93d35e8a90d6b1d8017880404dbe28f702f618838dbc9d349e14550a0fe","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"804a1ff33f6be4e844e22f8a79ab8a522755d22d14243c7b3e0294e5870634c0","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"de6db971d4bb999007b355594d0937df14a43a7a04d65d74febf7fbd8cc03d54","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"7cb96e2ba9f839b475b36a1c1b6a02d69f19de688221bc2b4649103e621cf39e","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"1f142e822da594adf7d2bba62167ab39153b79fe1fc59086eeb01a4d54d54d0b","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"dd909c05e4396ff46371de9f20bae0ab87d3537517c9f4ee04d0089c1e850f18","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"eac7dadccb0e44e660350acaf5d57ef5f05ef4d5121a1467af66178b5ef9bc5d","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"d9662aa95aa27759ca6b1a5945ebfc9dad72fa67a3b9ffee0a78b5b78584b74c","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"42c759b9e21947909aa84ebcc11969eb5dd7b51ec552cf216540b5aa78157c15","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"272464c6eda00dfad83fa497629efe5c0afde2ea3dd98aaf001353071eb32211","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"6e08027a0a0dd10613891c56f3612c8a1d80be72fd5433013a0f83c450e0a8a3","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"6b03a1d929a40dc88badbc5f789584148971608b1cc192eaa71546f67918d263","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"ffe53c3d7e611b787234a4950c33a38b5f7185dea7ffa43525a1200b3004af40","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"db31287eae79748f3b70efe8ea00d935d7ec1b1fddd4669d88e41a4d062366d7","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"f0b9c41a7fc94038f008ace08f8902249409b6c6d44b74c5e0d2425b3e4be00f","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"aa976b70535da04adbf7c95318aadb5f7a4d9608608b4e2f0de8ecca96aa1afc","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"48e101a616be7555a123b2f6609ec356bfc7359f710743da9f7dade70d7fa7e4","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"378073cd408965c7ce472d04f4690a3538a0d8cc39bd87946e69c7639645ae6a","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"b543466ba5e52a5daeb2e4a8f69242832cea294f54be3059cc5695df27def132","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"7b4eb8e3929ce14cde96769e568e28dc06345e2ff3d337dc2825ac8a826918a7","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"c8f3c5f38e07b00f820b991754720574311fb1a142844b7ebcb68cb6a05c4d83","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"70dc59e5b4b20a7f5a893d967f8fa34419f5211b38b627b09e1a8cca2fbfba61","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"da9f46f287c27912f07ce127c5e97da8f8e5250c8a31f238763a832b2b8111d4","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"b1569cf082f5fedc6125a4dc17df45acaa180f17b08ac23000ed667b44d624cc","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"7d7d66d9f1361a281bbd08f98fd9a92fc1a264aed3e16e687b0c723184a33f24","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"810e077e0d2ea6884ec068eba5f6792da003907deadfd32b8ce6de5003892a0e","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"763747c48caa3540ddd830e85dc6e934a3028d5c5f61add0752876781edb4732","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"a637fd01b197df89cc0f0bedfd0947b8f356d844ab8ec0019b61995db01953a3","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"a28766b26bb9508cdbd03bd7753903d0a5f6e64be3e6d53443d5d746a8daa6dc","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"0f4f7843665d01b93fe8d65ffa7547699850f362185591699045ad5d05815d83","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"89a3a45366816aa5ae95c6f4c0b0cc6bd3e178315ca2997f67b153409663e8bb","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"b6d7d53218f8a2c0065d9c6a75cafd886b20208ea713f406f6aa70a220133e15","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"eefb08a0e956e1626152dcd888d124f6acc5a931b47dede332386ecd030fe8e3","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"b9274f627734b0cd3f21200ab69dea4e7a689f07cb7401217468635a49a9d9bf","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"df92d0fd22c88802b9ab6f0c06723343adad8daac64a0ce4450e158362b0ebe0","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"2d1ebcff9a6a1cb85c0a88ba23de8ddcfb19ced9db4e1850fe2c82733d66e664","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"1a39634d78649f3193026ceffb999ee4c399bab54f9ad3f1a0b3ecbaf861c476","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"d45d6e5d239ffba3d65b100bb467a74444abe95ce2968f4a95d2fc74a9d5d7d0","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"bf6b6c61d4072226c74554d3df42c3587bb14988a4fe44b5a8422a48cf9606a4","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"51d6979282a4b3371a142012f8cf2b1d3deca1209ae322cbbfe7909cd2d64025","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"39c3999367306531537d265696d2241469b46d880ca48be0cbfee78d4ed9042e","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"8214732081c00e1eb5f1a5a8ae6b7f1d89917f304e0f1afcc555f207abb9297d","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"1b0d8ef7cfc9c334ecfd55c789a99bafa789f233aa034f325e3d71ced559e0db","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"ec9a6dbebb77c3c900ea7fd4a5ed6931a89e2739384763cd6b7ebf24c73f1241","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"ad9066f6af6f18e524b3d53d977dfefec3aceae371b30b57a3172e45139fc2fc","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"62a49f50ba1aa3d08094d6b80d1df63dd1729a1586fdf0cb44ca7aa67ff9c310","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"d8c853ef11d3c8b900a93ea0883d7457b92d6aee40b8eaf74df46d2dabeadeed","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"109d84c978cacdd7f1c67bf603013e3269446a0f82c358e0fa7d68b685c3d3a4","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"4a968a4aa0278856d3447134cd8c460a3bdf8cbad545d90ededa6aa10ea698c9","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"0f4f7843665d01b93fe8d65ffa7547699850f362185591699045ad5d05815d83","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"9fd0593e348ef9b1b4668cfebe648abba8f59918d9745317809d7f0a2cbf0670","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"883247be474512c7318105d2283a8305bffc038bb58d21e962fa1cc96a446572","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"9baff6f611d584ff07c8b4400aca2c3e3bba5d57ec398c4650567fbdf2565366","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"e88b6fdbe6e80d7a4ebcce06dedff672917feac58a86d4414e6641f68d6ca4f2","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"556e54849892db92912192434b366d09ac352c00136ffafd2e09696b11a58337","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"831ebcaec072300c0263bde9385e270320a7d8a1db12ffb758f88db47593c479","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"a7d21d9425a3fb2065f804dc1e0164baddd58b938ba2874ddf2d365af496fed7","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"1db743d5598e99eafb72a0ba1d6bddd1397b718f7c7aa365aec0ea2f864b4be7","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"4cc620fd2504785fe0b31e55d3c3191260023977976747c5d0eb80ffc591889a","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"f6be96807be04a68c9b7a1a3c9ea917bd19bed4fcb49871b122cf6caaa6090d9","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"70dd0c9c238965b4577790fd1e9d0755abc9ccedbaac6b5371fe1285a9ab7d4c","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"9ab324c915d34358d8ebb09ab818635cf20e97327f8ba3ef204c4db9d69a39a2","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"7b169f8bae34c837bac7ca04b9b40646d94194266d5ff44ee41de4691816917f","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"3debf70e442a4a2524b23e7ff1c33638ee5e5b2da65db774784caa90d87e71ef","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"b86d228ece050faca52aa0918dd729ab56ac6fe19d4e615f72b06463ecbec4a2","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"96ffec944b4ead96a5a7b49bab20d111bfcf390c602d57916d2ad1c11025302f","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","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":"5a7e9e257d926242281ee72cd9ecf62fe0808a1652bfa6f2595f4b341848128b","course_id":"COMPSCI/ISYE 723","course_uid":"course_b6ee9e2bd841018bd3a65997","catalog_version_id":"4974cb238c4fef140a1acf09ecb4348604f2d7d2ebbbf94a69a026870bd5977c","course_number":723,"subjects":["COMPSCI","ISYE"],"title":"DYNAMIC PROGRAMMING AND ASSOCIATED TOPICS","description":"General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes.  Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/​I SY E/​MATH/​STAT  525, I SY E 623,COMP SCI/​I SY E/​MATH/​STAT  726), knowledge of analysis (e.g.,MATH/​STAT  431or521) and programming ability (e.g.,COMP SCI 200or 301)","requirements_text":"Graduate/professional standing"}]