Pages that link to "Item:Q4012419"
From MaRDI portal
The following pages link to Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419):
Displaying 50 items.
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Facets from gadgets (Q2220662) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Robust computation of linear models by convex relaxation (Q2351804) (← links)
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic (Q2353474) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization (Q2448210) (← links)
- On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
- Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope (Q2448881) (← links)
- Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- On the commutativity of antiblocker diagrams under lift-and-project operators (Q2500533) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Approximate extended formulations (Q2583138) (← links)
