Research map / Learning theory and algorithms / Combinatorial and search optimization
The SoftCumulative Constraint with Quadratic Penalty
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 |
|---|---|---|---|
| Use the SoftCumulative checker and filtering algorithm instead of the decomposition | SoftCumulative scheduling · Adapted KSD15_D, linear cost | instances where method is better: 77.5% of instances; decomposition is better on 1% | Helped |
| Use the SoftCumulative checker and filtering algorithm instead of the decomposition | SoftCumulative scheduling · Adapted KSD15_D, quadratic cost | instances where method is better: 72.7% of instances; decomposition is better on 2.7% | Helped |
| Combine the checker with the filtering algorithm rather than use the checker alone (ablation) | SoftCumulative · Adapted KSD15_D | solve time | Helped |
Closest papers by meaning
- Assignment Problems in Cost Function Networks (AAAI 2026 · similarity 0.85)
- Efficient Truthful Scheduling and Resource Allocation through Monitoring (AAAI 2021 · similarity 0.84)
- Differentiable Combinatorial Scheduling at Scale (ICML 2024 · similarity 0.83)
- What Are the Rules? Discovering Constraints from Data (AAAI 2024 · similarity 0.83)
- Solving Integer Quadratic Programming via Explicit and Structural Restrictions (AAAI 2019 · similarity 0.83)
- ACM-MILP: Adaptive Constraint Modification via Grouping and Selection for Hardness-Preserving MILP Instance Generation (ICML 2024 · similarity 0.82)
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.