The biobjective minimum-cost perfect matching problem and Chinese postman problem
Year of publication: |
2024
|
---|---|
Authors: | Pozo, Miguel A. ; Puerto, Justo ; Roldán, Ignacio |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 5, p. 2988-3009
|
Subject: | biobjective optimization | CPP | Pareto front | PMP | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | China | Matching |
-
Böttcher, Michael, (2012)
-
Platoon optimization based on truck pairs
Bhoopalam, Anirudh Kishore, (2023)
-
Optimization methods and algorithms
Biró, Péter, (2024)
- More ...
-
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
Labbé, Martine, (2019)
-
The multicriteria p-facility median location problem on networks
Kalcsics, Jörg, (2014)
-
Modelling and planning public cultural schedules for efficient use of resources
Ortega, Francisco A., (2015)
- More ...