Home > Research > Browse

Research

Results for Branch-and-cut

Publications & Outputs

  1. Facets from gadgets

    Letchford, A. & Vu, A., 1/01/2021, In: Mathematical Programming. 185, 1-2, p. 297-314 18 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  2. Projection results for the k-partition problem

    Fairbrother, J. & Letchford, A. N., 8/11/2017, In: Discrete Optimization. 26, p. 97-111 15 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  3. An algorithmic framework for the exact solution of tree-star problems

    Leitner, M., Ljubic, I., Salazar-Gonzalez, J. J. & Sinnl, M., 16/08/2017, In: European Journal of Operational Research. 261, 1, p. 54-66 13 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  4. An exact algorithm for a Vehicle-and-Driver Scheduling Problem

    Dominguez-Martin, B., Rodriguez-Martin, I. & Jose Salazar-Gonzalez, J., 05/2017, In: Computers and Operations Research. 81, p. 247-256 10 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  5. Hierarchical Survivable Network Design Problems

    Rodríguez-Martín, I., Salazar-González, J. J. & Yaman, H., 1/06/2016, In: Electronic Notes in Discrete Mathematics. 52, p. 229-236 8 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review

  6. A branch-and-cut algorithm for two-level survivable network design problems

    Rodriguez-Martin, I., Salazar-Gonzalez, J-J. & Yaman, H., 03/2016, In: Computers and Operations Research. 67, p. 102-112 11 p.

    Research output: Contribution to Journal/Magazine › Journal article › peer-review