Pages that link to "Item:Q1825140"
From MaRDI portal
The following pages link to The cut polytope and the Boolean quadric polytope (Q1825140):
Displayed 18 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- A note on the Boolean quadric polytope (Q2564624) (← links)
- The QAP-polytope and the star transformation (Q5939231) (← links)