||A very simple application that will help you get started working with MIPCL quickly.
||Fixed Charge Flow Network Problem.
The application shows how to implement a class for solving mass MIPs).
||Simple application that solves an LP with unfeasible domain and
prints a certificate of unfeasibility.
||Maximum cost subgraph with restrictions on node degrees.
The application demonstrates
using MIPCL for solving MIPs with exponentially many constraints
represented via separation subroutines. The application also demonstrates
using multiple copies of CMIP (or CLP).
||Single Machine Scheduling problem. This application shows how
to implement user defined branching rules.
||Cutting Stock Problem. This is a standard application for
demonstrating column generation.
||Generalized Assignment Problem.
This is a standard application for demonstrating branch-and-price.
||Traveling Salesman Problem. This complex application
- simultaneous cut and column generation;
- storing cuts in user's pool.