Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|4|367-379

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.4, 2015-07, pp. : 367-379

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

By Leitner Markus  

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 3, 2011-09 ,pp. : 245-267

Springer Publishing Company

Access to resources Recommend Favorite

A Branch-and-Cut Algorithm for the Median-Path Problem

By Avella Pasquale   Boccia Maurizio   Sforza Antonio   Vasil'Ev Igor  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 215-230

Springer Publishing Company

Access to resources Recommend Favorite

Polyhedral results and a Branch-and-cut algorithm for the [TEX equation: k] -cardinality tree problem

By Simonetti Luidi   Cunha Alexandre   Lucena Abilio  

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 511-538

Elsevier

Access to resources Recommend Favorite

The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

By Dumitrescu Irina  

Mathematical Programming, Vol. 121, Iss. 2, 2010-02 ,pp. : 269-305

Elsevier

Access to resources Recommend Favorite

A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 2, 2015-03 ,pp. : 139-154

John Wiley & Sons Inc

Access to resources Recommend Favorite