Mathematical Programming: Series A and B
The cut polytope and the Boolean quadric polytope
Discrete Mathematics
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Geometry of Cuts and Metrics
Operations Research Letters
Partitioning planar graphs: a fast combinatorial approach for max-cut
Computational Optimization and Applications
| Hi-index | 0.00 |
In many practical applications, the task is to optimize a non-linear function over a well-studied polytope P as, e.g., the matching polytope or the travelling salesman polytope (TSP). In this paper, we focus on quadratic objective functions. Prominent examples are the quadratic assignment and the quadratic knapsack problem; further applications occur in various areas such as production planning or automatic graph drawing. In order to apply branch-and-cut methods for the exact solution of such problems, they have to be linearized. However, the standard linearization usually leads to very weak relaxations. On the other hand, problem-specific polyhedral studies are often time-consuming. Our goal is the design of general separation routines that can replace detailed polyhedral studies of the resulting polytope and that can be used as a black box. As unconstrained binary quadratic optimization is equivalent to the maximum cut problem, knowledge about cut polytopes can be used in our setting. Other separation routines are inspired by the local cuts that have been developed by Applegate, Bixby, Chvátal and Cook for faster solution of large-scale traveling salesman instances. By extensive experiments, we show that both methods can drastically accelerate the solution of constrained quadratic 0/1 problems.