New bounds for optimum traffic assignment in satellite communication.
From MaRDI portal
Publication:1406681
DOI10.1016/S0305-0548(98)00012-4zbMath1042.90527MaRDI QIDQ1406681
Mauro Dell'Amico, Marco Trubian, Francesco Maffioli
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B20: Traffic problems in operations research
Uses Software
Cites Work
- Unnamed Item
- Traffic assignment in communication satellites
- On the complexity of decomposing matrices arising in satellite communication
- A genetic algorithm for flowshop sequencing
- The \(k\)-cardinality assignment problem
- Solution of large weighted equicut problems
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Open shop, satellite communication and a theorem by Egerváry (1931)
- The NP-Completeness of Edge-Coloring
- Open Shop Scheduling to Minimize Finish Time
- Bandwidth Packing: A Tabu Search Approach
- An Overview of Scheduling Problems Arising in Satellite Communications