The Boolean Quadric Polytope (Q5050144)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7616612

Language	Label	Description	Also known as
English	The Boolean Quadric Polytope	scientific article; zbMATH DE number 7616612

Statements

scholarly article

0 references

The Boolean Quadric Polytope (English)

0 references

Adam N. Letchford

0 references

The Quadratic Unconstrained Binary Optimization Problem

0 references

publication date

15 November 2022

0 references

zbMATH Keywords

Boolean quadric polytope

0 references

polyhedral theory

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-04520-2_4

0 references

Polyhedral techniques in combinatorial optimization I: Theory

0 references

Polyhedral techniques in combinatorial optimization II: applications and computations

0 references

0 references

Discrete and Computational Geometry

0 references

Stronger linear programming relaxations of max-cut

0 references

On the cut polytope

0 references

Experiments in quadratic 0-1 programming

0 references

Lifting and separation procedures for the cut polytope

0 references

Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions

0 references

0 references

Separating subdivision of bicycle wheel inequalities over cut polytopes

0 references

Fifty-Plus Years of Combinatorial Integer Programming

0 references

Solving Large-Scale Zero-One Linear Programming Problems

0 references

The cut polytope and the Boolean quadric polytope

0 references

A note on the Boolean quadric polytope

0 references

0 references

0 references

Geometry of cuts and metrics

0 references

The hypermetric cone is polyhedral

0 references

A cut-and-branch algorithm for the quadratic knapsack problem

0 references

Gap inequalities for non-convex mixed-integer quadratic programs

0 references

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

0 references

Some simplified NP-complete graph problems

0 references

Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope

0 references

Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Outline of an algorithm for integer solutions to linear programs

0 references

A Cutting Plane Algorithm for the Linear Ordering Problem

0 references

Geometric algorithms and combinatorial optimization

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

Box-inequalities for quadratic assignment polytopes

0 references

A note on the 2-circulant inequalities for the MAX-cut problem

0 references

On Linear Characterizations of Combinatorial Optimization Problems

0 references

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup>

0 references

Improved semidefinite bounding procedure for solving max-cut problems to optimality

0 references

An Automatic Method of Solving Discrete Programming Problems

0 references

On a positive semidefinite relaxation of the cut polytope

0 references

Gap inequalities for the cut polytope

0 references

Binary positive semidefinite matrices and associated integer polytopes

0 references

A new separation algorithm for the Boolean quadric and cut polytopes

0 references

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

0 references

Cardinality constrained Boolean quadratic polytope

0 references

Integer programming approaches to the travelling salesman problem

0 references

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

Correlation polytopes: Their geometry and complexity

0 references

Nonpolyhedral Relaxations of Graph-Bisection Problems

0 references

Max-cut in circulant graphs

0 references

The expected relative error of the polyhedral approximation of the max- cut problem

0 references

A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming

0 references

A convex polytope of diameter one

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

A study of the quadratic semi-assignment polytope

0 references

Enhancing RLT relaxations via a new class of semidefinite cuts

0 references

0 references

New facets and a branch-and-cut algorithm for the weighted clique problem.

0 references

Elementare Theorie der konvexen Polyeder

0 references

A polyhedral approach for nonconvex quadratic programming problems with box constraints

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-04520-2_4

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5050144

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5050144&oldid=37457577"