On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
From MaRDI portal
Publication:2397091
DOI10.1007/S10589-016-9856-7zbMATH Open1371.90088OpenAlexW2430322353MaRDI QIDQ2397091FDOQ2397091
Ricardo Lima, Ignacio E. Grossmann
Publication date: 29 May 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9856-7
Recommendations
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- The Boolean quadratic programming problem with generalized upper bound constraints
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- SCIP: solving constraint integer programs
- The quadratic knapsack problem -- a survey
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Benchmarking optimization software with performance profiles.
- A polyhedral branch-and-cut approach to global optimization
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithm for cardinality-constrained quadratic optimization
- A survey for the quadratic assignment problem
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- An efficient algorithm for a task allocation problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- An evolutionary algorithm for polishing mixed integer programming solutions
- Branching and bounds tighteningtechniques for non-convex MINLP
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Min-cut clustering
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- A branch and bound algorithm for the maximum diversity problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- On Nonconvex Quadratic Programming with Box Constraints
- A linearization framework for unconstrained quadratic (0-1) problems
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Experiments in quadratic 0-1 programming
- A quadratic assignment formulation of the molecular conformation problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- ``Miniaturized linearizations for quadratic 0/1 problems
- Cardinality constrained Boolean quadratic polytope
- Compact linearization for binary quadratic problems
- A polyhedral approach for a constrained quadratic 0-1 problem
Cited In (10)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Provable randomized rounding for minimum-similarity diversification
- Balancing stability and efficiency in team formation as a generalized roommate problem
- The Boolean quadratic programming problem with generalized upper bound constraints
- Risk-averse formulations and methods for a virtual power plant
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- An exact cutting plane method for the Euclidean max-sum diversity problem
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Network-Based Approximate Linear Programming for Discrete Optimization
Uses Software
This page was built for publication: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397091)
