Pages that link to "Item:Q3360657"
From MaRDI portal
The following pages link to Deux problèmes d'ordonnancement en télécommunications par satellite (Q3360657):
Displaying 17 items.
- Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- Constraint programming for planning test campaigns of communications satellites (Q1701233) (← links)
- Using the generalized assignment problem in scheduling the ROSAT space telescope (Q1806665) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- On the tractability of satellite range scheduling (Q2017833) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- AFSCN scheduling: how the problem and solution have evolved (Q2473179) (← links)
- Tactical and strategic models for satellite customer assignment (Q3156448) (← links)
- Minimum Spillage Sequencing (Q3780747) (← links)
- Designing satellite communication networks by zero—one quadratic programming (Q3823407) (← links)
- An Overview of Scheduling Problems Arising in Satellite Communications (Q4300224) (← links)
- A note on scheduling problems arising in satellite communications (Q4345524) (← links)
- Scheduling space-ground communications for the air force satellite control network (Q5892096) (← links)
- Scheduling space-ground communications for the air force satellite control network (Q5920388) (← links)
