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.

• 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)
• A new lift-and-project operator (Q1752818) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• Geometric proofs for convex hull defining formulations (Q1755829) (← links)
• A bilevel fixed charge location model for facilities under imminent attack (Q1762124) (← 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)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
• Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• Tighter representations for set partitioning problems (Q1917353) (← links)
• A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
• Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
• Elliptic approximations of propositional formulae (Q1961455) (← 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)
• An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
• A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• An optimal data-splitting algorithm for aircraft sequencing on a single runway (Q2070768) (← 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)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
• Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering (Q2168744) (← links)
• Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
• MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles (Q2178342) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Product assortment and space allocation strategies to attract loyal and non-loyal customers (Q2184066) (← links)
• On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
• Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
• Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
• Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)