Research map / Learning theory and algorithms / Combinatorial and search optimization
Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Optimize control variables jointly with bipartite matching using the proposed min-cost-flow approximation | ISPCB · Ride-hailing platform and crowd-sourcing simulations | ER | Helped |
Closest papers by meaning
- Stochastic Matching via Local Sparsification (NeurIPS 2026 · similarity 0.85)
- Stochastic Matching Bandits with Rare Optimization Updates (NeurIPS 2026 · similarity 0.85)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.85)
- MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation (ICML 2024 · similarity 0.83)
- DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models (ICML 2025 · similarity 0.83)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.