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):
Displaying 14 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- 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)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← 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)
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems (Q2770136) (← links)
