No article text was recorded for this version.
separation problem complexity
Version 1 of 111 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: New Classes of Facets for Complementarity Knapsack Problems
- Blog: Box Facets and Cut Facets of Lifted Multicut Polytopes
- Blog: A knapsack intersection hierarchy
- Blog: Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Blog: On bounded pitch inequalities for the min-knapsack polytope
- Blog: Integer programming models for round robin tournaments
- Blog: Computational aspects of lifted cover inequalities for knapsacks with few different weights
- Blog: Simple odd $β$-cycle inequalities for binary polynomial optimization
- Blog: Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets
- Blog: A Neural Separation Algorithm for the Rounded Capacity Inequalities
- Blog: Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_separation_problem_complexity_299d5dc7,
title = {separation problem complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/separation-problem-complexity/rdr_299d5dc767b447f9a6691b0c49c3b350},
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_separation_problem_complexity_299d5dc7_v1,
title = {separation problem complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/separation-problem-complexity/rdr_299d5dc767b447f9a6691b0c49c3b350/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}