An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
From MaRDI portal
Publication:427399
DOI10.1007/s10898-011-9713-2zbMath1268.90040OpenAlexW2020020638WikidataQ57445446 ScholiaQ57445446MaRDI QIDQ427399
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9713-2
nonlinear integer programminglower boundsoptimality conditionbranch-and-bound methodquadratic 0--1 programmingvariable fixation
Related Items
Mathematical Programming Models and Exact Algorithms, Building an iterative heuristic solver for a quantum annealer, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, The unconstrained binary quadratic programming problem: a survey, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, A polynomial case of convex integer quadratic programming problems with box integer constraints, A semi-supervised random vector functional-link network based on the transductive framework, An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The indefinite zero-one quadratic problem
- An improved enumerative algorithm for solving quadratic zero-one programming
- Pseudo-Boolean optimization
- Unconstrained quadratic bivalent programming problem
- 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
- Experiments in quadratic 0-1 programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A quadratic assignment formulation of the molecular conformation problem
- Laplacian eigenvalues and the maximum cut problem
- Minimization of a quadratic pseudo-Boolean function
- Global optimization techniques for solving the general quadratic integer programming problem
- Seizure warning algorithm based on optimization and nonlinear dynamics
- A branch and cut algorithm for hub location problems with single assignment
- A polyhedral study of nonconvex quadratic programs with box constraints
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- The basic algorithm for pseudo-Boolean programming revisited
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- An algorithm for quadratic zero-one programs
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Quadratic knapsack problems
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Decomposition Method for Quadratic Zero-One Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
