Pages that link to "Item:Q2386196"

The following pages link to Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196):

Displaying 34 items.

• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
• SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression (Q319716) (← links)
• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
• An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
• Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
• A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs (Q1026920) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
• Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic (Q2288876) (← links)
• A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
• Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)