![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
The knobs applyCompression reads out of options.config. More...
#include <line/solvers/env/solver_env_meanfield.h>
Public Attributes | |
| std::string | da = "courtois" |
| options.config.da: courtois (the reference's default), kms, takahashi, multi. | |
| std::size_t | da_iter = 10 |
| options.config.da_iter: sweeps for the two iterative kernels. | |
| double | env_alpha = 0.01 |
| options.config.env_alpha: the beam search's per-depth merge penalty. | |
| std::size_t | beam_width = 3 |
| Beam width, the reference's hard-coded B = 3. | |
| std::size_t | beam_above_stages = 10 |
| Stage count above which the reference switches from the pairwise search to the beam search. | |
| MacroPartition | partition |
| A partition supplied by the caller, which SKIPS the search entirely. | |
The knobs applyCompression reads out of options.config.
Definition at line 103 of file solver_env_meanfield.h.
| std::size_t line::env::EnvCompressOptions::beam_above_stages = 10 |
Stage count above which the reference switches from the pairwise search to the beam search.
The two are genuinely different searches, not one search with a budget, so the threshold changes the answer and is exposed.
Definition at line 117 of file solver_env_meanfield.h.
| std::size_t line::env::EnvCompressOptions::beam_width = 3 |
Beam width, the reference's hard-coded B = 3.
Definition at line 111 of file solver_env_meanfield.h.
| std::string line::env::EnvCompressOptions::da = "courtois" |
options.config.da: courtois (the reference's default), kms, takahashi, multi.
Definition at line 105 of file solver_env_meanfield.h.
| std::size_t line::env::EnvCompressOptions::da_iter = 10 |
options.config.da_iter: sweeps for the two iterative kernels.
Definition at line 107 of file solver_env_meanfield.h.
| double line::env::EnvCompressOptions::env_alpha = 0.01 |
options.config.env_alpha: the beam search's per-depth merge penalty.
Definition at line 109 of file solver_env_meanfield.h.
| MacroPartition line::env::EnvCompressOptions::partition |
A partition supplied by the caller, which SKIPS the search entirely.
Worth having because both searches evaluate a decomposition per candidate pair, and a caller who already knows the group structure – a repair model whose stages are (working, degraded) times (peak, offpeak), say – should not pay for rediscovering it.
Definition at line 125 of file solver_env_meanfield.h.