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 45 items.
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design (Q2576440) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Robust solution of nonconvex global optimization problems (Q2576450) (← links)
- On the numerical solution of the quadratic eigenvalue complementarity problem (Q2630755) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
- A two-variable approach to the two-trust-region subproblem (Q2796795) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- On Throughput Maximization Problem for UWB-Based Sensor Networks via Reformulation–Linearization Technique (Q2917219) (← links)
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
- Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation (Q3194703) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility (Q4607140) (← links)
- Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration (Q4636381) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models (Q4909338) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty (Q5067432) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- Novel formulations for the sequence selection problem in de novo protein design with flexible templates (Q5758166) (← links)
- Constraint aggregation for rigorous global optimization (Q5962722) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
- Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
