- The Traveling Salesman Problem (Interactive MIRO demo)
The traveling salesman problem is a standard use for discrete optimization. The problem is known to be NP-Hard, and is often used to demonstrate techniques that might be viable for large scale instances. There are heuristics that are also used. The approach here shows how to use cutting planes that are generated "on-the-fly" to solve a problem visiting all the state capitols in the United States.
- Covid group testing (Interactive MIRO demo)
Covid-19 has created a serious testing situation where existing resources are not sufficient for testing each individual. One solution is group testing where multiple people can be tested using resources usually needed for a single person. Once samples are collected, the model determines what group testing strategy each lab should use and how the samples should be allocated from centers to labs, obtaining as many correctly processed kits as possible. This is implemented using GAMS/MIRO. Users can run the model on default data, view the results, then change data to generate a new scenario, comparing two saved scenarios in the comparison tool.