Pages that link to "Item:Q1825140"
From MaRDI portal
The following pages link to The cut polytope and the Boolean quadric polytope (Q1825140):
Displaying 50 items.
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← 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)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← 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)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← 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)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- \(k\)-neighborly faces of the Boolean quadric polytopes (Q2259296) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← 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)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
