Models and algorithms for the reconfiguration of distributed wireless switching systems
From MaRDI portal
Publication:941008
DOI10.1007/s10288-007-0048-2zbMath1151.90434MaRDI 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
scheduling; distributed systems; simulated annealing; branch-and-bound; branch-and-cut; polyhedral combinatorics
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
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