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

Author： Avella Pasquale Boccia Maurizio Sforza Antonio Vasil'Ev Igor

ISSN： 0926-6003

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

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

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

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

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

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

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

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

A branch and bound algorithm for the robust shortest path problem with interval data

By Montemanni R. Gambardella L.M. Donati A.V.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 225-232

Elsevier

Access to resources Recommend Favorite