Rethinking LEO Constellations Routing with the Unsplittable Multi-Commodity Flows Problem.
Paul GrislainNicolas PelissierFrançois LamotheOana HotescuJérôme LacanEmmanuel LochinJosé RadzikPublished in: ASMS/SPSC (2022)
Keyphrases
- multi commodity
- facility location
- heuristic solution
- max min
- network flow problem
- miller tucker zemlin
- routing algorithm
- network design
- routing problem
- knapsack problem
- shortest path
- minimum cost
- integer programming
- np hard
- multi criteria
- neural network
- hill climbing
- lot sizing
- min max
- network design problem
- lower bound