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.
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (Q867926) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem (Q1007148) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Commutative association schemes (Q1039424) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Conically bounded sets and optimization (Q1116404) (← links)
- Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Lift and project relaxations for the matching and related polytopes (Q1421469) (← links)
- Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957) (← links)
- Semidefinite programming (Q1600854) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
