Pages that link to "Item:Q4427377"
From MaRDI portal
The following pages link to A Class of Hard Small 0-1 Programs (Q4427377):
Displaying 15 items.
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Lattice based extended formulations for integer linear equality systems (Q847838) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
- Counting Solutions of Knapsack Constraints (Q5387631) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)