Research map / Learning theory and algorithms / Combinatorial and search optimization
Assignment Problems in Cost Function Networks
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.
Closest papers by meaning
- Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning (AAAI 2025 · similarity 0.85)
- The SoftCumulative Constraint with Quadratic Penalty (AAAI 2022 · similarity 0.85)
- Finding Good Partial Assignments during Restart-Based Branch and Bound Search (AAAI 2023 · similarity 0.84)
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021 · similarity 0.84)
- Predicting Lagrangian Multipliers for Mixed Integer Linear Programs (ICML 2024 · similarity 0.83)
- Are Graph Neural Networks Optimal Approximation Algorithms? (NeurIPS 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.