Models and algorithms for the reconfiguration of distributed wireless switching systems
DOI10.1007/S10288-007-0048-2zbMath1151.90434OpenAlexW2033942180MaRDI QIDQ941008
Publication date: 4 September 2008
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-007-0048-2
schedulingdistributed systemssimulated annealingbranch-and-boundbranch-and-cutpolyhedral combinatorics
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Combinatorial optimization problems in wireless switch design
- Approximate solution of a resource-constrained scheduling problem
- On the solution of reroute sequence planning problem in MPLS networks.
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- A branch-and-cut algorithm for a resource-constrained scheduling problem
This page was built for publication: Models and algorithms for the reconfiguration of distributed wireless switching systems
