The Boolean quadric polytope: some characteristics, facets and relatives

A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints

Journal of Global Optimization

Pseudo-boolean optimization

Discrete Applied Mathematics

A polyhedral approach for a constrained quadratic 0-1 problem

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

A tight lower bound for a special case of quadratic 0-1 programming

Computing

In situ column generation for a cutting-stock problem

Computers and Operations Research

Designing cost-effective content distribution networks

Computers and Operations Research

The quadratic knapsack problem-a survey

Discrete Applied Mathematics

Box-constrained quadratic programs with fixed charge variables

Journal of Global Optimization

Exact algorithms for the joint object placement and request routing problem in content distribution networks

Computers and Operations Research

A network approach for specially structured linear programs arising in 0-1 quadratic optimization

Discrete Applied Mathematics

Graphical Models, Exponential Families, and Variational Inference

Foundations and Trends® in Machine Learning

A linearization framework for unconstrained quadratic (0-1) problems

Discrete Applied Mathematics

A polyhedral approach for a constrained quadratic 0-1 problem

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

Binary positive semidefinite matrices and associated integer polytopes

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs

Discrete Applied Mathematics

Knapsack problem with probability constraints

Journal of Global Optimization

Integer quadratic quasi-polyhedra

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Boolean polynomials and set functions

Mathematical and Computer Modelling: An International Journal

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete Optimization

Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization

A study of the quadratic semi-assignment polytope

Discrete Optimization

A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope

Operations Research Letters

Cliques and clustering: A combinatorial approach

Operations Research Letters

The partial constraint satisfaction problem: Facets and lifting theorems

Operations Research Letters

Upper-bounds for quadratic 0-1 maximization

Operations Research Letters

A polyhedral study of the maximum edge subgraph problem

Discrete Applied Mathematics

On valid inequalities for quadratic programming with continuous variables and binary indicators

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization