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.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Phase retrieval for imaging problems (Q340015) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
