Pages that link to "Item:Q1280199"
From MaRDI portal
The following pages link to A reformulation-linearization technique for solving discrete and continuous nonconvex problems (Q1280199):
Displaying 50 items.
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- An integer linear programming approach for bilinear integer programming (Q435736) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- A fractional programming approach for retail category price optimization (Q708901) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← 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)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Optimization of a quadratic function with a circulant matrix (Q853879) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Computing lower and upper expectations under epistemic independence (Q881798) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A comparative analysis of several asymmetric traveling salesman problem formulations (Q955595) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
