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.
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Geometric proofs for convex hull defining formulations (Q1755829) (← links)
- Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Set characterizations and convex extensions for geometric convex-hull proofs (Q2089779) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
