Pages that link to "Item:Q1060960"
From MaRDI portal
The following pages link to On the complexity of decomposing matrices arising in satellite communication (Q1060960):
Displayed 15 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- On the complexity of decomposing matrices arising in satellite communication (Q1060960) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- Time-slot assignment for TDMA-systems (Q2265947) (← links)
- THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS (Q3166742) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- A heuristic for decomposing traffic matrices in TDMA satellite communication (Q4277996) (← links)
- Constrained partitioning problems (Q5896609) (← links)