Pages that link to "Item:Q1122479"
From MaRDI portal
The following pages link to The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479):
Displayed 50 items.
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- Designing cost-effective content distribution networks (Q869005) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- On a problem of integer optimization (Q926647) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← 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)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- Separating subdivision of bicycle wheel inequalities over cut polytopes (Q1306466) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- Min-cut clustering (Q1321669) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- The volume of relaxed Boolean-quadric and cut polytopes (Q1356562) (← links)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Relaxation optical bistability: A new class of optically bistable elements (Q1595496) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← 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)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
- (Q4949164) (← links)