Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott
| Year of publication: |
2019
|
|---|---|
| Authors: | Gadegaard, Sune Lauth ; Nielsen, Lars Relund ; Ehrgott, Matthias |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 31.2019, 4, p. 790-804
|
| Subject: | bi-objective branch-and-cut | bi-objective optimization | combinatorial optimization | branch-and-cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2018.0846 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012125747