Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
From MaRDI portal
Publication:1779531
DOI10.1016/j.ejor.2003.04.011zbMath1066.90101OpenAlexW2109771665MaRDI QIDQ1779531
Komei Fukuda, J.-A. Ferrez, Thomas M. Liebling
Publication date: 1 June 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.04.011
Related Items
\texttt{mplrs}: a scalable parallel vertex/facet enumeration code, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, A Polytope for a Product of Real Linear Functions in 0/1 Variables, Introduction to QUBO, Complexity and Polynomially Solvable Special Cases of QUBO, From the zonotope construction to the Minkowski addition of convex polytopes, Parallel enumeration of triangulations, New semidefinite programming relaxations for box constrained quadratic program, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, A class of optimization problems motivated by rank estimators in robust regression, Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Elliptic polytopes and invariant norms of linear operators, A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data, The generalized vertex cover problem and some variations, On reduction of duality gap in quadratic knapsack problems, Parametric Lagrangian dual for the binary quadratic programming problem, A new polynomially solvable class of quadratic optimization problems with box constraints, Unnamed Item, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A solvable case of quadratic 0-1 programming
- Reverse search for enumeration
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Constructing Arrangements of Lines and Hyperplanes with Applications
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Minimum cuts and related problems
- Lectures on Polytopes
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Partition of Space
- A polynomial case of unconstrained zero-one quadratic optimization
