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.
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← 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)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← 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)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← 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)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← 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)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- The matching problem has no small symmetric SDP (Q1675264) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
