[HTML][HTML] A class of valid inequalities for multilinear 0–1 optimization problems
This paper investigates the polytope associated with the classical standard linearization
technique for the unconstrained optimization of multilinear polynomials in 0–1 variables. A …
technique for the unconstrained optimization of multilinear polynomials in 0–1 variables. A …
Berge-acyclic multilinear 0–1 optimization problems
The problem of optimizing a multilinear polynomial f in 0–1 variables arises in applications
from many different areas. We are interested in resolution methods based on reformulating …
from many different areas. We are interested in resolution methods based on reformulating …
A cut-and-branch algorithm for the quadratic knapsack problem
Abstract The Quadratic Knapsack Problem (QKP) is a well-known NP-hard combinatorial
optimisation problem, with many practical applications. We present a 'cut-and …
optimisation problem, with many practical applications. We present a 'cut-and …
An RLT approach for solving the binary-constrained mixed linear complementarity problem
It is well known that the mixed linear complementarity problem can be used to model
equilibria in energy markets as well as a host of other engineering and economic problems …
equilibria in energy markets as well as a host of other engineering and economic problems …
A new family of facet defining inequalities for the maximum edge-weighted clique problem
This paper considers a family of cutting planes, recently developed for mixed 0–1
polynomial programs and shows that they define facets for the maximum edge-weighted …
polynomial programs and shows that they define facets for the maximum edge-weighted …