Search Results for "problem a"

MCM-ICM is a curated archive of Outstanding Winner (“O-奖/特等奖”) solution papers from the Mathematical Contest in Modeling and the Interdisciplinary Contest in Modeling, spanning the early 2000s through recent years. The repository is organized by year, with per-year folders that collect the top-ranked reports and, in later years, additional materials such as problem statements or problem notes when available. It has evolved from a single-maintainer project into a collaborative effort, with different contributors stewarding successive year ranges so the collection stays current. The contents skew toward MATLAB and LaTeX, reflecting the tools most winning teams use to build models and typeset their reports; you’ll typically see complete write-ups alongside code that implements optimization, simulation, statistical analysis, or other modeling pipelines.

Development platform and toolboxes for parameter continuation, e.g., bifurcation analysis of dynamical systems and constrained design optimization. This material is based upon work partially supported by the National Science Foundation under Grant No. 1016467 and the Danish research council (FTP) under the project number 0602-00753B. Any opinions, findings, and conclusions or recommendations expressed on this site are those of the authors and do not necessarily reflect the views of the...

...It includes LaTeX templates for writing solutions, records of past contest problems and winning solutions, algorithm implementations in MATLAB / M scripts for optimization, intelligent algorithms, numerical methods, and model frameworks. In effect, it is a curated library of modeling code, papers, templates, and algorithm summaries tailored to competition preparation. Historical problem and solution archives from many contests. Summary of contest evaluation criteria and heuristics.

...The repository organizes material across pure and applied mathematics, including calculus, linear algebra, probability, statistics, and optimization. It also extends into computational and algorithmic applications of mathematics, making it a useful reference for both academic study and practical problem-solving. The goal is to provide learners, researchers, and developers with a consolidated source of foundational and advanced mathematical concepts. By gathering a diverse set of topics into one repository, it supports continuous learning and interdisciplinary exploration. Its open source nature allows for community contributions and adaptation to different educational or research needs.

SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request. We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++. In particular, SparsePOPC++-windows contains a binary file which works on Windows, and does not require to compile.

The problem of Pagerank is a simple one to state: Given a collection of websites, how do we rank them? The primary way of formulating this utilizes a transition matrix which relates how web pages interact with each other. We investigate what the effect of a low rank approximation for the transition matrix has on the power method and an inner-outer iteration for solving the Pagerank problem.