Home > Research > Browse

Results for bi-objective branch-and-cut, bi-objective optimization, combinatorial optimization, branch-and-cut

Publications & Outputs

  1. Bi-objective branch-and-cut algorithms based on LP-relaxation and bound sets

    Gadegaard, S. L., Nielsen, L. R. & Ehrgott, M., 1/11/2019, In: INFORMS Journal on Computing. 31, 4, p. 790-804 15 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review