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.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing (Q336824) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs (Q431017) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Extended formulations for convex envelopes (Q486393) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
