Pages that link to "Item:Q3197621"
From MaRDI portal
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.
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Approximating \(k\)-median via pseudo-approximation (Q2805513) (← links)
- Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut (Q2861558) (← links)
- Stochastic quadratic knapsack with recourse (Q2883557) (← links)
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- SDP gaps from pairwise independence (Q2913812) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- New Tools for Graph Coloring (Q3088076) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- PEBBLE GAMES AND LINEAR EQUATIONS (Q3450805) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- Cutting Planes and the Parameter Cutwidth (Q3576046) (← links)
- Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Throughput optimization for the Robotic Cell Problem with Controllable Processing Times (Q4603940) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4633022) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- The Multilinear Polytope for Acyclic Hypergraphs (Q4637506) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
