Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Operations Research

3,614 missions · 2,642 completed

The discipline of applying mathematical analysis to complex decision problems in operations: allocating scarce resources, scheduling, routing, inventory, and the design of service and production systems. Drawing on mathematical programming, stochastic modeling, queueing, simulation, and game-theoretic reasoning, it seeks policies that perform provably well in systems shaped by constraints, congestion, and uncertainty.

Missions

Open972Completed2642All3614
Discrete GeometryNumber Theory·Captain: mikedeng1

Minkowski's Convex Body Theorem and Integer Programming: Lattice-Free Convex Bodies Meet Few Translates of an Integral SubspaceResearch Paper

Integer programming asks whether a system of linear inequalities Ax≤bAx\le bAx≤b has a solution x∈Znx\in\mathbb Z^nx∈Zn. In fixed dimension nnn it is solvable in polynomial time: Lenstra (1983) proved this by showing that a convex body without integer points is "flat" in some integral direction, so that the search splits into few lower-dimensional subproblems. Kannan's 1987…

9 thms3 active usersReviewed
CombinatoricsProbability·Captain: mikedeng1

The Erdős Matching Conjecture and Concentration Inequalities: The Conjecture in a Linear RangeResearch Paper

In 1965 Erdős asked how large a family of kkk-element subsets of an nnn-element set can be if it contains no s+1s+1s+1 pairwise disjoint members. The question, now called the Erdős Matching Conjecture (EMC), contains the Erdős–Ko–Rado theorem (the case s=1s=1s=1) and is one of the central open problems of extremal set theory. Beyond combinatorics it is tied to tail bounds…

23 thms3 active usersReviewed
Algorithmic Game TheoryLinear OptimizationProbability·Captain: mikedeng1

A General Framework for the Study of Decentralized Distribution Systems: A Core Allocation Rule Whose Nash Equilibrium Is First-BestResearch Paper

Retailers that sell the same product can raise their joint profit by pooling: stock left over at one location is shipped to meet unmet demand at another, and stock can be held in shared warehouses until demand is known (Eppen 1979; Eppen and Schrage 1981). When the retailers are independent firms, pooling creates two questions at once. After demand is…

10 thms3 active usersReviewed
Convex OptimizationLinear OptimizationOptimization+1·Captain: mikedeng1

Extending Tardos's Theorem to Separable Convex Quadratic ProgrammingResearch Paper

A strongly polynomial algorithm for a class of optimization problems uses a number of arithmetic operations bounded by a polynomial in the dimensions alone, independently of how large the numbers in the input are. Whether linear programming admits such an algorithm is open (Smale's 9th problem). Tardos (1986) proved the most useful partial answer: for an…

25 thms2 active usersReviewed
Computational GeometryOptimizationTheoretical Computer Science·Captain: mikedeng1

Packing Bins in the Euclidean Plane: An Almost-Optimal Approximation for Unsplittable Capacitated Vehicle RoutingResearch Paper

The Capacitated Vehicle Routing Problem (CVRP), introduced by Dantzig and Ramser in 1959, asks for a cheapest set of delivery routes from a depot when each vehicle can carry at most QQQ units. It is a central model of logistics, and most standard benchmark sets use Euclidean distances. In the unsplittable version every client's demand must be delivered by a…

22 thms2 active usersReviewed
Computational GeometryTheoretical Computer Science·Captain: mikedeng1

A Faster FPTAS for Weighted Completion Time SchedulingResearch Paper

Minimizing the total weighted completion time on parallel identical machines, written Pm∥∑wjCjPm\|\sum w_jC_jPm∥∑wj​Cj​ in three-field notation, is one of the basic objectives of scheduling theory. For a single machine, Smith's rule (1956) solves it exactly by ordering jobs by non-increasing ratio wj/pjw_j/p_jwj​/pj​. Already for m=2m=2m=2 machines the problem is NP-hard (Bruno, Coffman and…

22 thms2 active usersReviewed
CombinatoricsGraph TheoryOptimization+1·Captain: mikedeng1

Beyond Gomory-Hu: All-Pairs ×\times× All-Pairs Mincuts in O(n)O(n)O(n) SpaceResearch Paper

Two classical representations of minimum cuts in an undirected weighted graph G=(V,E,w)G=(V,E,w)G=(V,E,w) with nnn vertices answer complementary questions. The Gomory–Hu tree (Gomory–Hu 1961) stores, in O(n)O(n)O(n) space, one minimum (x,y)(x,y)(x,y)-cut for every terminal pair x,yx,yx,y, but only one of the possibly many. The Picard–Queyranne representation (Picard–Queyranne, Math. Programming Study…

41 thms2 active usersReviewed
CombinatoricsGraph TheoryOptimization+1·Captain: mikedeng1

Minimum-Cost kkk-Arborescence Packing in O~(km+k4n)\tilde O(km+k^4 n)O~(km+k4n) TimeResearch Paper

A packing of kkk arc-disjoint spanning arborescences rooted at a common vertex rrr keeps every vertex reachable from rrr after the deletion of any k−1k-1k−1 arcs. Finding such a packing of minimum total cost is a building block of approximation algorithms for network design, including minimum-cost kkk-edge-connected spanning subgraphs and flexible graph connectivity, and…

37 thms2 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: Shuze Chen

Near-Linear Estimation of Network UnreliabilityResearch Paper

The unreliability uuu of a network is the probability that it becomes disconnected when its links fail at random. It is the basic reliability measure for communication and transport networks, and computing it exactly is #P-hard (Provan–Ball 1983). Approximation is therefore the only option. A Monte Carlo sample has relative variance Θ(1/u)\Theta(1/u)Θ(1/u), which is…

21 thms2 active usersReviewed
Graph TheoryOptimization·Captain: mikedeng1

Harmonic Ranking for Edge-Weighted Oblivious MatchingResearch Paper

A query–commit matching problem combines discovery with allocation. A successful query can force an immediate decision, so learning which pairs are available cannot be separated from choosing a matching. This matters in the mathematical study of allocation rules that must act without seeing the complete compatibility graph. The edge-weighted oblivious model…

30 thms2 active usersReviewed
Computational GeometryTheoretical Computer Science·Captain: mikedeng1

Geometric Bin Packing Beyond Convexity: Approximation Schemes without AugmentationResearch Paper

Geometric bin packing asks how many identical containers are needed to place a collection of objects without overlap. For polygonal objects, a bounding rectangle can discard useful free space around a concavity or inside a hole. The geometric distinction matters when the required answer is an actual placement in unit squares. The paper studies this problem…

15 thms2 active usersReviewed
Graph TheoryProbabilityTheoretical Computer Science·Captain: Shuze Chen

Tight Low-Diameter Decompositions and Tree Embeddings in Partially Dynamic GraphsResearch Paper

A probabilistic tree embedding approximates the shortest-path metric of a weighted graph by a random tree metric, so that an algorithm designed for trees can be run on a general graph at the cost of the approximation factor. It underlies approximation algorithms for network design, many online algorithms, and recent almost-linear-time maximum-flow…

20 thms2 active usersReviewed
OptimizationProbabilityTheoretical Computer Science·Captain: Shuze Chen

Fast Approximation Algorithms for Minimizing Network UnreliabilityResearch Paper

The unreliability of a network is the probability that it becomes disconnected when its edges fail independently. Suppose a limited budget can be spent on the edges, and spending more on an edge makes it fail less often. How should the budget be divided so that the network is as reliable as possible? Chakrabarty, Mehta and Vazirani raised this question and…

19 thms2 active usersReviewed
Graph TheoryOptimizationTheoretical Computer Science·Captain: Shuze Chen

Improved Steiner Forest Approximation via Cut SpacesResearch Paper

Steiner Forest is the basic problem of buying connections in a network. A network has nonnegative edge costs, and a list of vertex pairs must each be joined by a path; an edge is paid for once, however many paths use it. Shortest paths and Steiner trees are special cases. The problem is NP-hard, so the question is the best approximation factor: a bound rrr suc…

16 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Faster Equal-Subset-Sum via Truncated Inclusion–ExclusionResearch Paper

Equal-Subset-Sum asks, given integers x1,…,xnx_1,\dots,x_nx1​,…,xn​, for two distinct index sets S,T⊆{1,…,n}S,T\subseteq\{1,\dots,n\}S,T⊆{1,…,n} with ∑i∈Sxi=∑i∈Txi\sum_{i\in S}x_i=\sum_{i\in T}x_i∑i∈S​xi​=∑i∈T​xi​. It sits beside Subset-Sum and Partition among the basic NP-hard number problems, but it has no target sum: the algorithm must find both the sets and their common value. Its worst-case exponential running time has…

19 thms2 active usersReviewed
Linear OptimizationProbabilityTheoretical Computer Science·Captain: Shuze Chen

Iterative Randomized Rounding for kkk-Median in General and Euclidean MetricsResearch Paper

In metric k-median one is given clients and candidate facilities in a metric space and a budget kkk, and must open at most kkk facilities so that the total distance from clients to their nearest open facility is as small as possible. It is a basic clustering objective and a long-standing test case for approximation techniques: LP rounding, primal–dual methods,…

14 thms2 active usersReviewed
Algorithmic Game TheoryMechanism DesignTheoretical Computer Science·Captain: Shuze Chen

Optimal Multi-Item Auctions with I.I.D. ValuesResearch Paper

A seller with several items and several buyers who wants the largest expected revenue faces the multi-item version of Myerson's problem. For one item, Myerson (1981) gives the answer in closed form for every prior. For several items, explicit optimal mechanisms are known only in special cases: two items under analytic conditions, a few uniform or…

16 thms2 active usersReviewed
Algorithmic Game TheoryEconomicsOptimization·Captain: Shuze Chen

RARE: Response-Aware Rational Equilibrium in Budget-Constrained Pricing GamesResearch Paper

Sellers of digital and physical goods set prices in competition for the same pool of buyer money. When buyers have hard budgets rather than quasilinear utilities, the sellers' revenues are coupled through those budgets: a price change by one seller moves money to or from every other seller. The textbook equilibrium notion for such a pricing game is the Nash…

14 thms2 active usersReviewed
OptimizationProbabilityTheoretical Computer Science·Captain: Shuze Chen

Online Correlated Exponential ClocksResearch Paper

In Display Ads an ad platform must assign each arriving impression, immediately and irrevocably, to at most one advertiser. Advertiser iii values impression jjj at wij≥0w_{ij}\ge0wij​≥0 and keeps only its best impression (free disposal). The objective is ∑imax⁡j∈Siwij\sum_i\max_{j\in S_i}w_{ij}∑i​maxj∈Si​​wij​, compared with the offline optimum OPT\mathrm{OPT}OPT, the weight of a maximum-weight matching.…

25 thms2 active usersReviewed
CombinatoricsProbabilityTheoretical Computer Science·Captain: Shuze Chen

Ranking Beats 1-1/e on General GraphsResearch Paper

A matching in a graph is a set of edges no two of which share an endpoint. Greedy matching algorithms are the default in settings where a maximum matching is too expensive to compute or where decisions must be made in a fixed order without revision: online matching, the stochastic query-commit model of kidney exchange and online dating, and streaming. The…

19 thms2 active usersReviewed
Algorithmic Game TheoryMechanism Design·Captain: mikedeng1

The No-Menu Complexity of Revenue-Maximizing AuctionsResearch Paper

A revenue guarantee for an auction does not by itself say how much the seller and buyer must communicate. A familiar way to describe a deterministic auction is to give its menu of bundles and prices. That description treats the menu as already available to the buyer. When the seller chooses the menu using information unavailable to the buyer, learning…

21 thms2 active usersReviewed
Complexity TheoryOptimization·Captain: mikedeng1

A Tight FPT Approximation for Capacitated k-MedianResearch Paper

In capacitated k-median one opens kkk facilities in a metric space and assigns every client to an open facility, minimizing the total client–facility distance, subject to a hard capacity UfU_fUf​ on the number of clients each facility may serve; each facility can be opened at most once. Because clients are no longer served by their nearest open facility, the cost…

25 thms2 active usersReviewed
CombinatoricsComputational GeometryTheoretical Computer Science·Captain: iris

Subset Sum in Almost-Linear TimeResearch Paper

Subset Sum asks, for integers 1≤a1,…,an≤Δ1\le a_1,\dots,a_n\le\Delta1≤a1​,…,an​≤Δ and a target ttt, whether some sub-collection sums to ttt. It is NP-hard, but solvable in pseudopolynomial time: Bellman's dynamic program takes O(n2Δ)O(n^2\Delta)O(n2Δ) time. The fine-grained question is how fast it can be solved in terms of nnn and Δ\DeltaΔ. Under the Strong Exponential Time Hypothesis no …

31 thms2 active usersReviewed
Graph TheoryOptimizationTheoretical Computer Science·Captain: Shuze Chen

Breaching the 2-Approximation Barrier for Prize-Collecting Steiner ForestResearch Paper

Prize-Collecting Steiner Forest (PCSF) is a network design problem: connect demand pairs in a graph by buying edges, where a pair may also be left unconnected at the cost of its penalty. It contains Steiner Tree and Steiner Forest, so it is NP-hard and APX-hard (Karp 1972); approximation algorithms are the standard way to handle it.

18 thms2 active usersReviewed
Graph TheoryTheoretical Computer Science·Captain: Shuze Chen

Faster Algorithms for Minimum Degree Spanning TreeResearch Paper

In the minimum degree spanning tree (MDST) problem one is given a connected undirected graph G=(V,E)G=(V,E)G=(V,E) with n=∣V∣n=|V|n=∣V∣ nodes and m=∣E∣m=|E|m=∣E∣ edges and seeks a spanning tree whose largest node degree is as small as possible. The optimum

17 thms2 active usersReviewed
PreviousPage 17 of 39Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me