scientific article; zbMATH DE number 3404028
From MaRDI portal
Publication:5670441
Cited in
(18)- A global continuation algorithm for solving binary quadratic programming problems
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- Minimization of ordered, symmetric half-products
- A polyhedral study of nonconvex quadratic programs with box constraints
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
- New semidefinite programming relaxations for box constrained quadratic program
- The multilinear polytope for acyclic hypergraphs
- New advances for quantum-inspired optimization
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Pseudo-Boolean optimization
- A continuous nonlinear optimization perspective on the spin glass problem
- A preprocessing technique for quadratic unconstrained binary optimization
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Box-constrained quadratic programs with fixed charge variables
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5670441)
