Pages that link to "Item:Q3762072"
From MaRDI portal
The following pages link to A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072):
Displaying 22 items.
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Biconvex Models and Algorithms for Risk Management Problems (Q4842694) (← links)
- (Q4887686) (← links)
- Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- Optimal Genetic Screening for Cystic Fibrosis (Q5031012) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty (Q5067432) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
- Equity in genetic newborn screening (Q6052533) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← 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)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
- Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)