Socially fair network design via iterative rounding
Year of publication: |
2022
|
---|---|
Authors: | Laddha, Aditi ; Singh, Mohit ; Vempala, Santosh S. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 5, p. 536-540
|
Subject: | Approximation algorithm | Iterative rounding | Network design | Algorithmus | Algorithm | Theorie | Theory | Netzwerk | Network | Unternehmensnetzwerk | Business network |
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Modeling and solving the multi-period disruptions scheduling problem on urban networks
Coco, Amadeu A., (2020)
-
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
Tawfik, Christine, (2022)
- More ...
-
Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
Brown, Adam, (2024)
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
Stochastic billiards for sampling from the boundary of a convex set
Dieker, A. B., (2015)
- More ...