Amanote Research
Register
Sign In
Solving Inter-As Bandwidth Guaranteed Provisioning Problems With Greedy Heuristics
doi 10.5772/5210
Full Text
Open PDF
Abstract
Available in
full text
Date
November 1, 2008
Authors
Kin-Hon Ho
Ning Wang
George Pavlou
Publisher
InTech
Related search
Traveling Salesman Should Not Be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP
BRICS Report Series
Service Overlay Networks: SLAs, QoS and Bandwidth Provisioning
Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection
Robust Constraint Solving Using Multiple Heuristics
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Probable Performance of Heuristics for Bandwidth Minimization
SIAM Journal on Computing
Mathematics
Computer Science
A Proportional Approach to Claims Problems With a Guaranteed Minimum
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Guaranteed Bounds for Robust LMI Problems With Polynomial Parameter Dependence
IFAC Proceedings Volumes
Bio-Inspired Population-Based Meta-Heuristics for Problem Solving
Natural Computing
Computer Science Applications
Solving Bilevel Problems With Polyhedral Constraint Set
Journal of Applied and Numerical Optimization
