Pages that link to "Item:Q3197621"

The following pages link to A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems (Q3197621):

Displaying 50 items.

• Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
• Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
• (Q5009502) (← links)
• Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty (Q5067432) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• Tractable Relaxations of Composite Functions (Q5085133) (← links)
• (Q5090398) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• Sherali-adams strikes back (Q5091758) (← links)
• (Q5121905) (← links)
• Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
• (Q5158503) (← links)
• BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
• Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
• Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
• Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
• No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
• Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
• Cones of multipowers and combinatorial optimization problems (Q5413066) (← links)
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming (Q5704137) (← links)
• (Q5743407) (← links)
• A Polyhedral Characterization of Border Bases (Q5744696) (← links)
• Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
• A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
• A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)
• A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
• Elementary closures for integer programs. (Q5937498) (← links)
• Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)