cutting inequalities

New cuts and a branch-cut-and-price model for the Multi Vehicle Covering Tour Problem

  • Bruno Oliveira
  • Artur Alves Pessoa
  • Marcos Roboredo
    • Categories Combinatorial Optimization, Cutting Plane Approaches, Integer Programming Tags , , , ,

    \(\) The Multi-Vehicle Covering Tour Problem (m-CTP) involves a graph in which the set of vertices is partitioned into a depot and three distinct subsets representing customers, mandatory facilities, and optional facilities. Each customer is linked to a specific subset of optional facilities that define its coverage set. The goal is to determine a set … Read more

    Generating Cutting Inequalities Successively for Quadratic Optimization Problems in Binary Variables

  • Sunyoung Kim
  • Masakazu Kojima
    • Categories 0-1 Programming, Linear, Cone and Semidefinite Programming, Quadratic Programming Tags , , , , , , ,

    We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$, while the standard cutting inequalities are used for the convex hull of the feasible region. An arbitrary linear inequality with integer coefficients … Read more