On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
From MaRDI portal
Publication:2397091
DOI10.1007/s10589-016-9856-7zbMath1371.90088OpenAlexW2430322353MaRDI QIDQ2397091
Ignacio E. Grossmann, Ricardo M. Lima
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
Related Items
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, Provable randomized rounding for minimum-similarity diversification, Risk-averse formulations and methods for a virtual power plant, \texttt{EXPEDIS}: an exact penalty method over discrete sets, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Balancing stability and efficiency in team formation as a generalized roommate problem, An exact cutting plane method for the Euclidean max-sum diversity problem, Network-Based Approximate Linear Programming for Discrete Optimization, Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
Uses Software
Cites Work
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- SCIP: solving constraint integer programs
- ``Miniaturized linearizations for quadratic 0/1 problems
- Algorithm for cardinality-constrained quadratic optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A survey for the quadratic assignment problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The quadratic knapsack problem -- a survey
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A linearization framework for unconstrained quadratic (0-1) problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A quadratic assignment formulation of the molecular conformation problem
- Min-cut clustering
- Cardinality constrained Boolean quadratic polytope
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- A polyhedral branch-and-cut approach to global optimization
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A branch and bound algorithm for the maximum diversity problem
- A polyhedral approach for a constrained quadratic 0-1 problem
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Compact linearization for binary quadratic problems
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Branching and bounds tighteningtechniques for non-convex MINLP
- On Nonconvex Quadratic Programming with Box Constraints
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- An efficient algorithm for a task allocation problem
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Benchmarking optimization software with performance profiles.
- Different Formulations for Solving the HeaviestK-Subgraph Problem
