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.
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs (Q2339823) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Sparse learning via Boolean relaxations (Q2349117) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- Configuration of airspace sectors for balancing air traffic controller workload (Q2393463) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints (Q2494810) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- Small Chvátal rank (Q2638380) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
- Integer programming approaches to the multiple team formation problem (Q2668786) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
