New bounds for optimum traffic assignment in satellite communication. (Q1406681): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Traffic assignment in communication satellites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop, satellite communication and a theorem by Egerváry (1931) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-cardinality assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large weighted equicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Scheduling Problems Arising in Satellite Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of decomposing matrices arising in satellite communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank

Latest revision as of 10:39, 6 June 2024

scientific article
Language Label Description Also known as
English
New bounds for optimum traffic assignment in satellite communication.
scientific article

    Statements