Pages that link to "Item:Q2397091"
From MaRDI portal
The following pages link to On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091):
Displaying 9 items.
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Risk-averse formulations and methods for a virtual power plant (Q1652695) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- Balancing stability and efficiency in team formation as a generalized roommate problem (Q6078610) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
