Research map / Learning theory and algorithms / Combinatorial and search optimization
Solving Constrained Combinatorial Optimisation Problems via MAP Inference without High-Order Penalties
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
- Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation (AAAI 2018 · similarity 0.88)
- Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch) (ICML 2021 · similarity 0.87)
- Inference in Higher Order MRF-MAP Problems With Small and Large Cliques (CVPR 2018 · similarity 0.87)
- Min Norm Point Algorithm for Higher Order MRF-MAP Inference (CVPR 2016 · similarity 0.86)
- Geometric Algorithms for Neural Combinatorial Optimization with Constraints (NeurIPS 2025 · similarity 0.84)
- Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization (ICML 2024 · similarity 0.84)
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.