Pages that link to "Item:Q1621692"

The following pages link to Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692):

Displaying 33 items.

• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
• A polyhedral approach for nonconvex quadratic programming problems with box constraints (Q1273053) (← links)
• A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
• Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
• Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
• Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
• A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
• On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
• Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
• On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• Skyport location problem for urban air mobility system (Q2669717) (← links)
• A computational study on QP problems with general linear constraints (Q2673522) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS (Q4900102) (← links)
• The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
• Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA (Q5095184) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
• (Q5158522) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Optimal design of line replaceable units (Q6150236) (← links)
• Data-driven decision model based on local two-stage weighted ensemble learning (Q6170946) (← links)
• Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
• On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)