Evaluating the quality of online optimization algorithms by discrete event simulation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1629852 (Why is no real title available?)
- scientific article; zbMATH DE number 1656903 (Why is no real title available?)
- scientific article; zbMATH DE number 1688603 (Why is no real title available?)
- scientific article; zbMATH DE number 50190 (Why is no real title available?)
- scientific article; zbMATH DE number 65698 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1947058 (Why is no real title available?)
- scientific article; zbMATH DE number 871933 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A method for solving traveling-salesman problems
- A new average case analysis for completion time scheduling
- A new measure for the study of on-line algorithms
- A stochastic model of bin-packing
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Beyond Competitive Analysis
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Comparison methods for stochastic models and risks
- Competitive snoopy caching
- Dynamic vehicle routing: Status and prospects
- Extending the accommodating function
- Information Theory and Statistical Mechanics
- Integer Programming Formulation of Traveling Salesman Problems
- Introduction to Discrete Event Systems
- Markov Paging
- On the Relative Dominance of Paging Algorithms
- On the relative dominance of paging algorithms
- On the separation and equivalence of paging strategies
- Online storage systems and transportation problems with applications. Optimization models and mathematical solutions.
- Optimization by simulated annealing
- Resource augmentation for online bounded space bin packing
- Smoothed analysis of algorithms
- Some Distribution-Free Aspects of Paging Algorithm Performance
- Speed is as powerful as clairvoyance
- The accommodating function: A generalization of the competitive ratio
- The relative worst order ratio for online algorithms
- The vehicle routing problem
This page was built for publication: Evaluating the quality of online optimization algorithms by discrete event simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1642796)