No article text was recorded for this version.
dual-bound pruning
Version 1 of 18 papers13 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Low-Rank Semidefinite Programming for the MAX2SAT Problem
- Blog: A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- Blog: Tightening Bounds for Bayesian Network Structure Learning
- Blog: Path Planning with CPD Heuristics
- Blog: Warm Start of Mixed-Integer Programs for Model Predictive Control of Hybrid Systems
- Blog: Integrating Sample-Based Planning and Model-Based Reinforcement Learning
- Blog: Partial Constraint Satisfaction
- Blog: Sequential Bayesian Experimental Design with Variable Cost Structure
History & citation
Current · Permanent link
- This direction split from Dual Bounding for Early Pruning in Global Optimization (75% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_dual_bound_pruning_9beb0af1,
title = {dual-bound pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dual-bound-pruning/rdr_9beb0af1f5604076a87214398f471232},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_dual_bound_pruning_9beb0af1_v1,
title = {dual-bound pruning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dual-bound-pruning/rdr_9beb0af1f5604076a87214398f471232/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}