An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing
Leizer L. Pinto, Kátia C.C. Fernandes, Kleber V. Cardoso, Nelson Maculan
| Year of publication: |
2019
|
|---|---|
| Authors: | Pinto, Leizer L. ; Fernandes, Kátia C. C. ; Cardoso, Kleber V. ; Maculan F., Nelson |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 106.2019, p. 28-35
|
| Subject: | Polynomial time | Network flow routing problem | Bi-objective optimization | ϵ-constraint technique | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2019.02.004 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012014344