Try Notedeck free · More Operations Research demos
← Notedeck 运筹学 · The assignment problem · Hungarian algorithm Try in Notedeck

The assignment problem · Hungarian algorithm — interactive Operations Research demo

Assign n workers to n jobs at minimum total cost — exactly one worker per job.

Run this interactive Operations Research demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.