The strong maximum circulation algorithm : a new method for aggregating preference rankings
| Year of publication: |
2025
|
|---|---|
| Authors: | Atkinson, Nathan ; Ganz, Scott ; Hochbaum, Dorit S. ; Orlin, James B. |
| Published in: |
INFORMS journal on optimization. - Catonsville, Md. : INFORMS, ISSN 2575-1492, ZDB-ID 2957493-6. - Vol. 7.2025, 2, p. 142-155
|
| Subject: | combinatorial optimization | network flow algorithms | preference aggregation | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Aggregation | Präferenztheorie | Theory of preferences |
-
Clautiaux, François, (2017)
-
Solving crop planning and rotation problems in a sustainable agriculture perspective
Benini, Mario, (2023)
-
A strongly polynomial algorithm for generalized flow maximization
Végh, László A., (2017)
- More ...
-
An algorithm for clustering with confidence-based must-link and cannot-link constraints
Baumann, Philipp, (2025)
-
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Hochbaum, Dorit S., (2021)
-
Nuclear threat detection with mobile distributed sensor networks
Hochbaum, Dorit S., (2011)
- More ...