![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Classification of a solution method, as printed in the solver banner: "<accuracy>, <randomness>" with accuracy in {exact, approximate, bound} and randomness in {deterministic, randomized}. More...
#include <map>#include <string>Go to the source code of this file.
Namespaces | |
| namespace | line |
| namespace | line::util |
Functions | |
| std::string | line::util::method_type (const std::string &solvername, const std::string &method) |
| Banner classification of a solution method. | |
Classification of a solution method, as printed in the solver banner: "<accuracy>, <randomness>" with accuracy in {exact, approximate, bound} and randomness in {deterministic, randomized}.
Conventions, applied uniformly across the four codebases (MATLAB line_method_type.m, JAR MethodType.java, python solvers/base.py):
Perfect sampling (cftp) is classified by the law it samples from, which is the stationary one, hence exact; the ordinary simulators are approximate because a finite horizon leaves warm-up bias on top of the sampling error.
The C++ CLI keeps its own key=value banner grammar, so this classification is printed there as type=exact,deterministic rather than inside the bracketed field list the other three codebases use.
Definition in file method_type.h.