Six months to my first HiMCM.

HiMCM is my first real modeling contest, so this site is the plan I'm holding myself to: learn the methods, work through every past problem, drill mock prompts I wrote myself, and finish with a paper the judges would actually want to read.

Start the 6-month plan → What is HiMCM?
Nov 4–172026 contest window
14 daysto choose, model, write
25 pagesPDF, 12-pt font
~1%earn Outstanding

What this site covers

Everything Barry needs in one place. Each module is a stand-alone page, but they're also stitched together as weeks in the six-month plan. Pick where to start based on what you need today.

Orient

About the contest

Rules, dates, team composition, judging tiers, and what "Outstanding" actually means.

Read briefing →
Write

Anatomy of a winning paper

Summary sheet, assumptions, model, sensitivity, letter — section by section with judge commentary.

See structure →
Learn

Modeling techniques

The dozen methods that keep showing up: AHP, TOPSIS, regression, ODEs, Monte Carlo, ARIMA, optimization.

Browse catalogue →
Tooling

Python toolkit

NumPy, SciPy, pandas, matplotlib, statsmodels, networkx, SimPy — snippets you can paste and adapt.

Open toolkit →
Study

Past problems 2025–2011

Every problem with a full restatement, a modeling outline, key formulas, and pitfalls.

See archive →
Practice

Original mock problems

Five problems written in HiMCM style with solution sketches, rubrics, and self-grading checklists.

Try a mock →
Grade

Rubric self-check

Interactive 16-row scorecard that mirrors how COMAP judges actually read papers. Weighted total maps to Outstanding / Finalist / Meritorious bands.

Self-grade a draft →
Win

Outstanding paper anatomy

Reverse-engineering the ~1% of HiMCM papers that win Outstanding: summary-sheet dissection, assumption quality (✗/✓), model coherence, real sensitivity, 27-item Outstanding-paper checklist.

See what wins →
Sample

Worked sample paper · 2025-A

Full reference paper for "Emergency Evacuation Sweeps" — summary sheet, 9 numbered equations, NetworkX + PuLP MILP code, Monte Carlo sensitivity tables, letter to the LEPC, AI-use appendix.

Read sample paper →
Sample

Worked sample paper · 2024-A

Full reference paper for "To Play or Not to Play" — summary sheet, 10 numbered equations, runnable Python, sensitivity tables, non-technical letter, AI-use appendix.

Read sample paper →
Sample

Worked sample paper · 2024-B

Full reference paper for "Environmental Impact of High-Powered Computing" — summary sheet, 10 numbered equations, per-region logistic + 6-state Markov mix Python, Sobol sensitivity, embodied + water extension, AI-use appendix.

Read sample paper →
Sample

Worked sample paper · 2023-A

Full reference paper for "Dandelions: Friend? Foe? Both? Neither?" — summary sheet, 9 numbered equations, Fisher–KPP PDE + EWM impact-factor Python, Sobol sensitivity tables, AI-use appendix.

Read sample paper →
Sample

Worked sample paper · 2023-B

Full reference paper for "Charging Ahead with E-buses" — summary sheet, 7 numbered equations, life-cycle CO₂ + per-cohort NPV + PuLP MILP roadmap code for three cities, Monte Carlo sensitivity, AI-use appendix.

Read sample paper →
Sample

Worked sample paper · 2022-A

Full reference paper for "The Need for Bees" — 9 equations, KMB-extended 5-compartment ODE in scipy.solve_ivp, Sobol sensitivity, hive-sizing for a 20-acre parcel under stress.

Read sample paper →
Sample

Worked sample paper · 2022-B

Full reference paper for "CO₂ and Global Warming" — 10 equations, six CO₂ models fit to Mauna Loa + GISTEMP, log T–C law with IPCC climate sensitivity range, ARIMA uncertainty band.

Read sample paper →
Archive

2021 problem set

Storing the Sun (utility-scale solar + storage sizing) and Tackling the Drought (Lake Mead reservoir operating policy).

Open 2021 →
Archive

2020 problem set

The Best Summer Job (MCDM warm-up: AHP + TOPSIS) and Funding Biodiversity Conservation (knapsack over Florida threatened plants).

Open 2020 →
Archive

2019 problem set

Charge! (US EV charging-network forecast + facility location) and Bottle Battles (campus single-use-bottle policy via compartmental flows).

Open 2019 →
Archive

2018 problem set

Roller Coaster (objective ranking on 300+ coasters with EWM/TOPSIS) and Cozy Smart House (thermal RC model + LP for HVAC scheduling).

Open 2018 →
Archive

2017 problem set

Drone Clusters as Sky Light Displays (swarm choreography + Hungarian assignment) and Ski Slope (DEM-based resort layout with M/M/c queueing).

Open 2017 →
Archive

2016 problem set

Swim, Bike, and Run (wave-start triathlon scheduling for 2,000 athletes under 5.5h closure) and Shop and Ship (continental warehouse set-cover with sales-tax overlay).

Open 2016 →
Archive

2015 problem set

Preventing Road Rage (Nagel–Schreckenberg CA + behavioral merge rule for late vs early merge) and City Crime and Safety (3-pillar composite index with AHP/EWM + DBSCAN hotspots).

Open 2015 →
Archive

2014 problem set

Unloading Commuter Trains (1D platform sim + Fruin stair capacity + k-center placement) and The Next Plague? (SEIR + severity decision table + LP resource allocation).

Open 2014 →
Archive

2013 problem set

Emergency Medical Response (MCLP ambulance placement, 8-min coverage, fleet degradation) and Bank Service Problem (M/G/c queueing with wait < 2 min and queue ≤ 2 targets).

Open 2013 →
Archive

2012 problem set

American Elk (stage-structured Lefkovitch matrix + stochastic PVA for Great Smoky Mountains) and How Much Gas Should I Buy This Week? (EIA price forecast + deadband decision rule).

Open 2012 →
Archive

2011 problem set

No More Space Shuttles (10-year ISS resupply MIP over Soyuz/Progress/ATV/HTV/Dragon/Cygnus) and Search and Find (nighttime penlight search with sweep-width model + parallel tracks).

Open 2011 →
Plan

Six-month plan

Week-by-week schedule from June 2026 through the contest weekend in November.

Open calendar →
Library

Resources & references

Books, courses, official PDFs, datasets, glossary of contest jargon and modeling vocabulary.

Browse links →

Suggested reading order

  1. Get oriented. Read About the contest end-to-end and skim two recent problems on the Past problems page so you have a sense of what 25 pages of analysis actually look like.
  2. Learn the paper. The structure of a HiMCM solution is fixed. Go through Anatomy of a winning paper next so every later technique has a place to land.
  3. Build the toolkit. Work through the modeling catalogue on Techniques and the matching code in the Python toolkit. Do small drills as you go.
  4. Practice on real problems. Pick a past problem and write a 5-page partial solution in a weekend. Compare against the judges' commentary linked from each problem page.
  5. Run a full mock. Once a month between July and October, do one mock problem under contest-like conditions (no outside help, 4 days, write the full paper).
  6. Final push. The six-month plan ramps to a dress-rehearsal in late October and the live contest Nov 4–17.

A few things judges actually reward

From COMAP's published judges' commentaries on Finalist and Outstanding papers:

Each of these is unpacked in detail on the paper page.

Big-picture reminders

Contest dates. The 2026 HiMCM runs from Wednesday, November 4, 2026 (window opens 3:01 pm EST) through Tuesday, November 17, 2026 (single hard deadline: 8:00 pm EST). Teams choose either Problem A or Problem B and have up to 14 days to work on it.
Communication rule. Once the window opens you may not discuss the problem with anyone outside your team — not your advisor, not other students, no chat rooms, no Discord, no Weibo, no social media. You can use any "inanimate" source (books, websites, datasets, papers, code libraries), and you must cite them.
AI tools. Permitted, but every use must be declared in a separate "Report on Use of AI" appendix that doesn't count toward the 25-page limit. The contents (model used, prompts, outputs) must be reproduced.