quadratic minimum spanning tree problem

A Polyhedral Characterization of Linearizable Quadratic Combinatorial Optimization Problems

  • Lucas Waddell
    • Categories 0-1 Programming, Combinatorial Optimization, Quadratic Programming Tags , , ,

    We introduce a polyhedral framework for characterizing instances of quadratic combinatorial optimization programs (QCOPs) that are linearizable, meaning that the quadratic objective can be equivalently rewritten as linear in such a manner that preserves the objective function value at all feasible solutions. In particular, we show that an instance is linearizable if and only if … Read more

    Lower Bounds for the Quadratic Minimum Spanning Tree Problem Based on Reduced Cost Computation

  • Federico Malucelli
  • Borzou Rostami
    • Categories Combinatorial Optimization, Quadratic Programming Tags , , , , ,

    The Minimum Spanning Tree Problem (MSTP) is one of the most known combinatorial optimization problems. It concerns the determination of a minimum edge-cost subgraph spanning all the vertices of a given connected graph. The Quadratic Minimum Spanning Tree Problem (QMSTP) is a variant of the MST whose cost considers also the interaction between every pair … Read more