The following pages link to Konstantinos Kaparis (Q408380):
Displayed 12 items.
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Operations research in the space industry (Q439363) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing (Q932268) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm (Q3167623) (← links)