On-line resources allocation for ATM networks with rerouting
From MaRDI portal
Publication:2489130
Recommendations
Cites work
- Combining VNS with constraint programming for solving anytime optimization problems
- Deliberation scheduling for problem solving in time-constrained environments
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1322793 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2080317 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- Maintaining reversible DAC for Max-CSP
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Optimization by simulated annealing
- Radio link frequency assignment
- Resource allocation in a mobile telephone network: A constructive repair algorithm
- SALSA: a language for search algorithms
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Variable neighborhood search
Cited in
(8)- Variable neighbourhood search: Methods and applications
- On-line resource management with application to routing and scheduling
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- Decentralized online integer programming problems with a coupling cardinality constraint
- On rerouting connection requests in networks with shared bandwidth
- Efficient reservations in open ATM network control using on-line measurements
- Combining VNS with constraint programming for solving anytime optimization problems
- Variable neighbourhood search: methods and applications
This page was built for publication: On-line resources allocation for ATM networks with rerouting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489130)