Pages that link to "Item:Q2349139"
From MaRDI portal
The following pages link to Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139):
Displayed 6 items.
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)