Pages that link to "Item:Q4427331"
From MaRDI portal
The following pages link to Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances (Q4427331):
Displayed 16 items.
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- High generalization performance structured self-attention model for knapsack problem (Q5025155) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)