Facility Location Problem Example — Complete facility location optimization problem demonstrating multiple facility site selection with capacity constraints and customer assignments.
0/1 Knapsack Example — The smallest complete model, and the one to start from: a set and indexed constants loaded from Python functions (lambdas and defs), a single-value constant, and results written with write_results. Runs as is with run.mjs.
MMORPG Skill Rotation Optimization Example — Complete MMORPG skill rotation optimizer demonstrating temporal sequencing, resource management (energy/combo points), finishing move constraints, and damage maximization with CSV data loading. Reads rogue.csv (not included) with pandas, so it does not run as is.
Office Allocation & Scheduling Example — Complete office allocation and time slot scheduling problem demonstrating preference-based assignment, bid optimization, temporal constraints, and advanced set functions with dynamic exclusion ranges.
Passive Optical Network (PON) Planning Example — Complete PON network design optimization demonstrating multi-commodity flow, splitter placement, capacity constraints, bidirectional arc generation, and network visualization with ECharts graph layout. Reads micronet.json (not included), so it does not run as is.
Resource Constrained Scheduling Problem (RCSP) Example — Complete RCSP optimization problem demonstrating project scheduling with resource constraints, time-indexed formulation, Excel data loading, and net present value maximization. Reads an Excel workbook (not included) with pandas, so it does not run as is.
Shortest Path Problem Example — Complete shortest path optimization problem demonstrating flow conservation constraints and network optimization using setminus for set operations.
Traveling Salesman Problem (TSP) Example — Complete TSP optimization problem demonstrating subtour elimination using MTZ (Miller-Tucker-Zemlin) constraints, set functions, and edge-based formulation.