Models and algorithms for the reconfiguration of distributed wireless switching systems
From MaRDI portal
Publication:941008
branch-and-boundbranch-and-cutdistributed systemspolyhedral combinatoricsschedulingsimulated annealing
Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Models of circuit-switching networks with distributed control
- Distributed wireless link scheduling in the SINR model
- Combinatorial optimization problems in wireless switch design
- Adaptive distributed dynamic channel allocation for wireless networks
- Distributed link scheduling in wireless networks
- Resource allocation in wireless networks. Theory and algorithms
- On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models
- Distributed Rate Allocation for Wireless Networks
- A New Approach for Rearrangeable Multicast Switching Networks
Cites work
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- Approximate solution of a resource-constrained scheduling problem
- Combinatorial optimization problems in wireless switch design
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- On the solution of reroute sequence planning problem in MPLS networks.
Cited in
(2)
This page was built for publication: Models and algorithms for the reconfiguration of distributed wireless switching systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941008)
