Operations Research Algorithms

Curated portfolio hub for optimization, scheduling, packing, and network-flow style problems implemented in Java, Python, and OR-Tools.

Purpose

This repository is intended to be the public umbrella for the algorithm side of the portfolio.

It should point visitors to:

• polished standalone solver repos
• shared problem notes
• implementation comparisons across languages and tools

Useful umbrella docs:

• docs/repo-map.md
• docs/implementation-matrix.md

Portfolio structure

Showcase repos

• multi-machine-interval-scheduling
• knapsack-and-greedy-algorithms
• python-cutting-stock-operations-research
• transportation-and-transshipment-models
• truck-cubing-bin-packing
• network-capacity-transport-planner

Learning / historical repos

These stay visible as part of the learning arc, but are not the polished public entry points:

• iit-cs-525-n-machine-m-jobs-project
• older course-era algorithm and systems repos

Core themes

• scheduling and sequencing
• cutting stock
• packing and cubing
• transportation and transshipment
• facility capacity planning
• greedy methods
• OR-Tools CP-SAT modeling
• reproducible input / output driven solver design

Working standard for each polished repo

Each public solver repo should include:

• README.md
• input/
• output/
• Java implementation where relevant
• Python implementation where relevant
• OR-Tools implementation where relevant
• tests
• sample results

Current build order

1. multi-machine-interval-scheduling
2. knapsack-and-greedy-algorithms
3. python-cutting-stock-operations-research
4. transportation-and-transshipment-models
5. truck-cubing-bin-packing
6. network-capacity-transport-planner