An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
From MaRDI portal
(Redirected from Publication:427399)
Recommendations
- Experiments in quadratic 0-1 programming
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- An algorithm for quadratic zero-one programs
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A Decomposition Method for Quadratic Zero-One Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch and cut algorithm for hub location problems with single assignment
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A polyhedral study of nonconvex quadratic programs with box constraints
- A quadratic assignment formulation of the molecular conformation problem
- Adaptive memory tabu search for binary quadratic programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An algorithm for quadratic zero-one programs
- An improved enumerative algorithm for solving quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- Experiments in quadratic 0-1 programming
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimization techniques for solving the general quadratic integer programming problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Laplacian eigenvalues and the maximum cut problem
- Lower bound improvement and forcing rule for quadratic binary programming
- L’algebre de Boole et ses applications en recherche operationnelle
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- Minimization of a quadratic pseudo-Boolean function
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Pseudo-Boolean optimization
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Quadratic knapsack problems
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The basic algorithm for pseudo-Boolean programming revisited
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(11)- A polynomial case of convex integer quadratic programming problems with box integer constraints
- The unconstrained binary quadratic programming problem: a survey
- Quadratic convex reformulations for semicontinuous quadratic programming
- Building an iterative heuristic solver for a quantum annealer
- Mathematical programming models and exact algorithms
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- 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
- scientific article; zbMATH DE number 1174443 (Why is no real title available?)
This page was built for publication: An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427399)
