| CIDisposable | |
| CULSAlgorithms.Exact.FedergruenTzur.Internal.FedergruenTzurCandidateTree | Array-backed balanced candidate tree for the Federgruen-Tzur forward algorithm |
| CULSAlgorithms.Exact.FedergruenTzur.Internal.FedergruenTzurLinearCandidateDeque | Array-backed monotone candidate deque used by the two linear-time Federgruen-Tzur specializations |
| CULSAlgorithms.Abstractions.IAsyncUlsSolver | Optional asynchronous companion contract for ULS strategies whose implementation delegates work to an external optimization engine |
| CULSAlgorithms.Exact.CuttingPlanes.LsCuttingPlaneSolverBase | Base implementation of an exact ULS cut-and-solve algorithm using classical (l,S) inequalities at the root LP relaxation followed by an exact MILP solve |
| CULSAlgorithms.Exact.CuttingPlanes.GeneralLsCuttingPlaneSolver | Exact ULS cut-and-solve strategy using exact general separation of the classical (l,S) convex-hull inequalities |
| CULSAlgorithms.Exact.CuttingPlanes.WagnerWhitinLsCuttingPlaneSolver | Exact ULS cut-and-solve strategy using the O(T^2) Wagner-Whitin specialization of the classical (l,S) inequalities |
| CULSAlgorithms.Exact.Formulations.SolverBackedUlsFormulationSolverBase | Base class for exact ULS strategies that build a mathematical formulation and solve it through the portable optimization execution layer |
| CULSAlgorithms.Exact.Formulations.AggregateInventoryFormulationSolver | Exact solver-backed ULS strategy using the classical aggregate production/setup/inventory formulation |
| CULSAlgorithms.Exact.Formulations.FacilityLocationFormulationSolver | Exact solver-backed ULS strategy using the disaggregated facility-location formulation |
| CULSAlgorithms.Exact.Formulations.InventoryEliminatedFormulationSolver | Exact solver-backed ULS strategy using the aggregate formulation in which inventory variables are algebraically eliminated |
| CULSAlgorithms.Exact.Formulations.ShortestPathFormulationSolver | Exact solver-backed ULS strategy using the regeneration shortest-path formulation |
| CULSAlgorithms.Abstractions.IUlsSolver | Defines the common strategy contract implemented by every ULS solver |
| CULSAlgorithms.Exact.AggarwalPark.AggarwalParkSolver | Implements the Aggarwal-Park recursive Monge-matrix algorithm for the uncapacitated economic lot-sizing problem |
| CULSAlgorithms.Exact.ChowdhuryBakiAzab.ChowdhuryBakiAzabSolver | Implements the linear-time Wagner-Whitin algorithm of Chowdhury, Baki and Azab |
| CULSAlgorithms.Exact.CuttingPlanes.LsCuttingPlaneSolverBase | Base implementation of an exact ULS cut-and-solve algorithm using classical (l,S) inequalities at the root LP relaxation followed by an exact MILP solve |
| CULSAlgorithms.Exact.FedergruenTzur.FedergruenTzurNoSpeculativeMotiveSolver | Implements Federgruen-Tzur's linear-time forward algorithm for models without speculative inventory motives |
| CULSAlgorithms.Exact.FedergruenTzur.FedergruenTzurNondecreasingSetupSolver | Implements Federgruen-Tzur's linear-time forward algorithm for nondecreasing setup costs |
| CULSAlgorithms.Exact.FedergruenTzur.FedergruenTzurSolver | Implements the general forward Federgruen-Tzur dynamic lot-sizing algorithm |
| CULSAlgorithms.Exact.Formulations.SolverBackedUlsFormulationSolverBase | Base class for exact ULS strategies that build a mathematical formulation and solve it through the portable optimization execution layer |
| CULSAlgorithms.Exact.JacobsKhumawala.JacobsKhumawalaBranchAndBoundSolver | Exact single-level lot-sizing procedure expressed as the simplified branch-and-bound/subproblem scheme of Jacobs and Khumawala |
| CULSAlgorithms.Exact.Parallel.LyuLeeParallelSolver | Parallel exact dynamic lot-sizing solver inspired by Lyu and Lee's lower-triangular parallel Wagner-Whitin computation |
| CULSAlgorithms.Exact.SaydamMcKnew.SaydamMcKnewFastWagnerWhitinSolver | High-throughput full Wagner-Whitin implementation in the spirit of Saydam and McKnew's fast microcomputer program |
| CULSAlgorithms.Exact.Wagelmans.WagelmansGeneralSolver | Solves the general uncapacitated economic lot-sizing problem in O(n log n) time using the backward geometric algorithm of Wagelmans, van Hoesel and Kolen |
| CULSAlgorithms.Exact.WagnerWhitin.BahlTajPlanningHorizonSolver | Implements the data-dependent Wagner-Whitin implementation proposed by Bahl and Taj, combining Evans' low-storage recurrence with the Wagner-Whitin Planning Horizon Theorem |
| CULSAlgorithms.Exact.WagnerWhitin.HeadyZhuEconomicPartPeriodSolver | Implements the Heady-Zhu family of improved Wagner-Whitin procedures using the Planning Horizon Theorem and the Economic-Part-Period pruning concept |
| CULSAlgorithms.Exact.WagnerWhitin.SadjadiAryanezhadSadeghiSolver | Implements the fixed-cost improved Wagner-Whitin method of Sadjadi, Aryanezhad and Sadeghi |
| CULSAlgorithms.Exact.WagnerWhitin.WagnerWhitinClassicalSolver | Implements the classical Wagner-Whitin shortest-path dynamic program |
| CULSAlgorithms.Exact.WagnerWhitin.WagnerWhitinEvansSolver | Implements the low-storage Wagner-Whitin dynamic program described by Evans |
| CULSAlgorithms.Exact.WagnerWhitin.WagnerWhitinSolver | Solves ULS instances with Wagner-Whitin costs in linear time |
| CULSAlgorithms.Exact.Zangwill.ZangwillNetworkSolver | Exact ULS solver using Zangwill's acyclic network representation |
| CULSAlgorithms.Heuristics.ChiuModifiedLeastUnitCostSolver | Implements Chiu's modified Least Unit Cost heuristic |
| CULSAlgorithms.Heuristics.ChiuTingModifiedPartPeriodBalancingSolver | Implements the modified Part-Period Balancing (mv-PPB) heuristic of Chiu, Ting and Chiu |
| CULSAlgorithms.Heuristics.FreelandColleySolver | Implements the Freeland-Colley incremental lot-sizing heuristic |
| CULSAlgorithms.Heuristics.GroffSolver | Implements Groff's marginal-cost lot-sizing rule |
| CULSAlgorithms.Heuristics.HoChangSolisImprovedNetLeastPeriodCostSolver | Implements the improved Ho-Chang-Solis nLPC(i) heuristic |
| CULSAlgorithms.Heuristics.HoChangSolisNetLeastPeriodCostSolver | Implements the Ho-Chang-Solis net Least Period Cost (nLPC) heuristic |
| CULSAlgorithms.Heuristics.KarniMaximumPartPeriodGainSolver | Implements Karni's Maximum Part-Period Gain (MPG) heuristic |
| CULSAlgorithms.Heuristics.LeastUnitCostSolver | Implements the classical Least Unit Cost (LUC) heuristic |
| CULSAlgorithms.Heuristics.LotForLotSolver | Implements the classical Lot-for-Lot (L4L/LFL) policy |
| CULSAlgorithms.Heuristics.McLarenOrderMomentSolver | Implements McLaren's Order Moment (MOM) lot-sizing heuristic |
| CULSAlgorithms.Heuristics.PartPeriodBalancingSolver | Implements classical nearest-EPP Part-Period Balancing (PPB) |
| CULSAlgorithms.Heuristics.PartPeriodSimplifiedSolver | Implements the Part-Period Simplified (PPS) rule, also described as the Least Total Cost (LTC) no-overshoot part-period rule |
| CULSAlgorithms.Heuristics.PattersonLaForgeIncrementalPartPeriodSolver | Implements the Patterson-LaForge Incremental Part-Period Algorithm (IPPA) |
| CULSAlgorithms.Heuristics.PeriodicOrderQuantitySolver | Implements the classical Periodic Order Quantity (POQ) rule |
| CULSAlgorithms.Heuristics.SegerstedtReformulatedSilverMealSolver | Implements the reformulated Silver-Meal (rSM, "Lägsta periodkostnad") heuristic of Segerstedt, Abdul-Jalbar and Samuelsson |
| CULSAlgorithms.Heuristics.SilverMealSolver | Implements the Silver-Meal least-cost-per-period heuristic |
| CULSAlgorithms.Heuristics.WemmerlovModifiedPartPeriodBalancingSolver | Implements Wemmerlöv's corrected Part-Period Balancing rule using the practical limiting correction factor v = 0.5 |
| CULSAlgorithms.Heuristics.WemmerlovModifiedPpbLookAheadLookBackSolver | Implements Wemmerlöv's corrected PPB (v = 0.5) combined with the modified Look-Ahead/Look-Back tests |
| CULSAlgorithms.Heuristics.WemmerlovPpbLookAheadLookBackSolver | Implements standard PPB followed by Wemmerlöv's modified Look-Ahead/Look-Back tests |
| CULSAlgorithms.Selection.AdaptiveExactUlsSolver | Selects and executes an efficient exact ULS algorithm from problem characteristics while preserving the common IUlsSolver contract |
| CULSAlgorithms.Catalog.UlsSolverCatalog | Canonical runtime inventory of every public IUlsSolver strategy |
| CULSAlgorithms.Catalog.UlsSolverConfiguration | Versioned, serializable definition of one ULS strategy and its constructor-level options |
| CULSAlgorithms.Catalog.UlsSolverCreationOptions | Composes the existing strategy-specific constructor options used by UlsSolverFactory |
| CULSAlgorithms.Catalog.UlsSolverDescriptor | Immutable metadata and construction entry for one public ULS strategy |
| CULSAlgorithms.Catalog.UlsSolverFactory | Creates public ULS strategies from stable catalog identifiers |
| CULSAlgorithms.CuttingPlanes.CutCoefficient | Stores one nonzero coefficient of a generated linear inequality |
| CULSAlgorithms.CuttingPlanes.CutGenerationReport | Complete cutting-plane traceability report for one solver-backed solve |
| CULSAlgorithms.CuttingPlanes.CutIterationReport | Traceability report for one cutting-plane iteration |
| CULSAlgorithms.CuttingPlanes.CutRecord | Trace record for one generated cutting-plane constraint |
| CULSAlgorithms.CuttingPlanes.CuttingPlaneConvergenceReport | Summarizes root-bound evolution and separation effort for one exact cut-and-solve execution |
| CULSAlgorithms.CuttingPlanes.CuttingPlaneExecutionReport | Combines solver-selection provenance, cutting-plane traceability and root convergence statistics |
| CULSAlgorithms.CuttingPlanes.CuttingPlaneIterationStatistics | Numerical convergence statistics for one root cutting-plane iteration |
| CULSAlgorithms.CuttingPlanes.Internal.LsCutKey | |
| CULSAlgorithms.CuttingPlanes.Internal.LsCutModelBuilder | |
| CULSAlgorithms.CuttingPlanes.Internal.LsCutSelector | |
| CULSAlgorithms.CuttingPlanes.LsCutDefinition | Solver-independent definition of one ULS (l,S) inequality |
| CULSAlgorithms.CuttingPlanes.LsCuttingPlaneOptions | Configures root LP (l,S) separation before the final exact MILP solve |
| CULSAlgorithms.CuttingPlanes.Separation.ILsCutSeparator | Separates classical ULS (l,S) inequalities from a fractional aggregate lot-sizing solution |
| CULSAlgorithms.CuttingPlanes.Separation.GeneralLsCutSeparator | Exact combinatorial separation of the classical general ULS (l,S) inequalities |
| CULSAlgorithms.CuttingPlanes.Separation.WagnerWhitinLsCutSeparator | Separates the O(T^2) Wagner-Whitin specialization of the classical ULS (l,S) inequalities |
| CULSAlgorithms.CuttingPlanes.Separation.Internal.LsSeparationMath | |
| CULSAlgorithms.CuttingPlanes.Separation.LsSeparatedCut | One candidate (l,S) inequality produced by a separation procedure |
| CULSAlgorithms.Exact.AggarwalPark.Internal.AggarwalParkMatrixSearch | SMAWK row-minimum search for the implicit Monge matrices generated by the Aggarwal-Park divide-and-conquer lot-sizing recursion |
| CULSAlgorithms.Exact.FedergruenTzur.Internal.FedergruenTzurLinearCore | Shared allocation-conscious forward recurrence for the two Federgruen-Tzur linear-time specializations |
| CULSAlgorithms.Exact.Formulations.Internal.UlsFormulationSolutionMapper | |
| CULSAlgorithms.Exact.Internal.UlsRegenerationCost | O(1) regeneration-interval cost evaluator for the uncapacitated zero-inventory-ordering structure |
| CULSAlgorithms.Exact.WagnerWhitin.Internal.ZeroInventoryOrderSolutionBuilder | Reconstructs a zero-inventory-order ULS solution from shortest-path predecessors |
| CULSAlgorithms.Formulations.Internal.LinearModelBuilder | |
| CULSAlgorithms.Formulations.Internal.UlsFormulationMath | |
| CULSAlgorithms.Formulations.IUlsFormulationBuilder | Builds a solver-independent mathematical-programming formulation of ULS |
| CULSAlgorithms.Formulations.Aggregate.AggregateInventoryFormulationBuilder | Builds the classical aggregate ULS mixed-integer formulation with production, setup and end-of-period inventory variables |
| CULSAlgorithms.Formulations.FacilityLocation.FacilityLocationFormulationBuilder | Builds the classical disaggregated/facility-location formulation of ULS |
| CULSAlgorithms.Formulations.InventoryEliminated.InventoryEliminatedFormulationBuilder | Builds an exact aggregate ULS formulation after algebraically eliminating end-of-period inventory variables |
| CULSAlgorithms.Formulations.ShortestPath.ShortestPathFormulationBuilder | Builds an acyclic regeneration-interval shortest-path formulation of ULS |
| CULSAlgorithms.Formulations.UlsFormulation | Solver-independent ULS mathematical formulation plus semantic variable map |
| CULSAlgorithms.Formulations.UlsFormulationCatalog | Creates the built-in classical ULS mathematical formulations |
| CULSAlgorithms.Formulations.UlsFormulationVariableMap | Maps semantic ULS decisions to solver-independent variable identifiers |
| CULSAlgorithms.Heuristics.Internal.ClassicHeuristicGuard | Shared applicability checks for classical stationary-cost lot-sizing heuristics |
| CULSAlgorithms.Heuristics.Internal.HeuristicSolutionBuilder | Builds and validates a zero-backlogging heuristic solution from a set of replenishment cycles |
| CULSAlgorithms.Heuristics.Internal.HoChangSolisNetLeastPeriodCostCore | Shared incremental implementation of the Ho-Chang-Solis net average period cost recursion |
| CULSAlgorithms.Heuristics.Internal.LastReplenishmentMergeImprover | Applies the published final-lot merge test used by the modified LUC and modified PPB heuristics |
| CULSAlgorithms.Heuristics.Internal.WemmerlovPpbCore | Shared implementation of the PPB variants analyzed by Wemmerlöv (1983) |
| CULSAlgorithms.Models.UlsProblem | Represents a validated classical uncapacitated lot-sizing problem |
| CULSAlgorithms.Models.UlsProblemValidator | Validates the numerical data of a classical finite-horizon ULS problem |
| CULSAlgorithms.Optimization.Adapters.Cplex.CplexInstallationDiscoveryResult | Result of searching the current machine for IBM ILOG CPLEX |
| CULSAlgorithms.Optimization.Adapters.Cplex.CplexInstallationLocator | Locates compatible IBM ILOG CPLEX installations without a compile-time reference to ILOG.Concert or ILOG.CPLEX |
| CULSAlgorithms.Optimization.Adapters.Xpress.XpressRuntimeLocator | Locates and loads the optional FICO Xpress Optimizer managed assembly |
| CULSAlgorithms.Optimization.DefaultSolverAdapterRegistry | Creates the built-in concrete solver-adapter registry |
| CULSAlgorithms.Optimization.Execution.CplexXmlSolutionParser | Parses CPLEX XML .sol files written by the stand-alone CPLEX optimizer |
| CULSAlgorithms.Optimization.Execution.DefaultLinearModelExecutorRegistry | Creates the built-in CPLEX, Gurobi, Xpress and CBC model executors |
| CULSAlgorithms.Optimization.Execution.ExternalSolverProcessRunner | Runs a solver command-line process with cancellation and captured output |
| CULSAlgorithms.Optimization.Execution.ILinearModelSolverExecutor | Executes the portable LinearModel with one concrete solver |
| CULSAlgorithms.Optimization.Execution.Providers.CoinOrCbcLinearModelExecutor | Executes portable LP/MILP models through the stand-alone COIN-OR CBC executable |
| CULSAlgorithms.Optimization.Execution.Providers.CplexLinearModelExecutor | Executes portable LP/MILP models through the stand-alone CPLEX optimizer |
| CULSAlgorithms.Optimization.Execution.Providers.GurobiLinearModelExecutor | Executes portable LP/MILP models through the official gurobi_cl executable |
| CULSAlgorithms.Optimization.Execution.Providers.XpressLinearModelExecutor | Executes portable LP/MILP models through the optional FICO Xpress Optimizer .NET runtime loaded by reflection |
| CULSAlgorithms.Optimization.Execution.LinearModelExecutorRegistry | Stores concrete portable-model execution backends by solver kind |
| CULSAlgorithms.Optimization.Execution.LinearModelSolutionValidation | Independent solver-agnostic validation of a returned variable assignment |
| CULSAlgorithms.Optimization.Execution.LinearModelSolutionValidator | Independently checks solver-returned values against the portable model |
| CULSAlgorithms.Optimization.Execution.LinearModelSolveOptions | Configures one solver-backed execution of a portable linear model |
| CULSAlgorithms.Optimization.Execution.LinearModelSolver | High-level solver-independent execution service for portable linear models |
| CULSAlgorithms.Optimization.Execution.LinearModelSolveResult | Result of executing a solver-independent linear or mixed-integer model |
| CULSAlgorithms.Optimization.Execution.LinearVariableValueNormalizer | Normalizes raw mathematical-variable values returned by optimization solvers before independent validation, objective reconstruction and ULS solution mapping |
| CULSAlgorithms.Optimization.Execution.NamedSolutionValueParser | Parses solver text solutions using portable variable names v_<id> |
| CULSAlgorithms.Optimization.Execution.PortableLpModelWriter | Writes a conservative LP representation understood by all four supported execution backends |
| CULSAlgorithms.Optimization.Execution.Providers.XpressExecutionReflectionApi | |
| CULSAlgorithms.Optimization.Execution.SolverExecutionUtilities | |
| CULSAlgorithms.Optimization.External.ExternalSolverExecutableLocator | Locates optional native-solver command-line executables without requiring their SDKs at compile time |
| CULSAlgorithms.Optimization.External.ExternalSolverProcessProbe | Executes short solver command-line probes and captures their output |
| CULSAlgorithms.Optimization.External.ExternalSolverProcessProbeResult | Captured result of a short external solver process probe |
| CULSAlgorithms.Optimization.IOptimizationSolverAdapter | Defines the common metadata and availability contract implemented by every optimization-solver adapter used by solver-backed ULS algorithms |
| CULSAlgorithms.Optimization.Adapters.OptimizationSolverAdapterBase | Base class for concrete optimization-solver availability adapters |
| CULSAlgorithms.Optimization.Adapters.CoinOrCbc.CoinOrCbcSolverAdapter | Detects and validates the stand-alone COIN-OR CBC executable |
| CULSAlgorithms.Optimization.Adapters.Cplex.CplexSolverAdapter | Detects and validates an optional IBM ILOG CPLEX installation |
| CULSAlgorithms.Optimization.Adapters.Gurobi.GurobiSolverAdapter | Detects and validates Gurobi through the official gurobi_cl executable |
| CULSAlgorithms.Optimization.Adapters.Xpress.XpressSolverAdapter | Detects and validates FICO Xpress through its optional Optimizer .NET assembly |
| CULSAlgorithms.Optimization.Modeling.LinearConstraint | Describes one portable linear constraint |
| CULSAlgorithms.Optimization.Modeling.LinearModel | Immutable solver-independent linear or mixed-integer linear model |
| CULSAlgorithms.Optimization.Modeling.LinearObjective | Describes the minimization objective of a portable linear model |
| CULSAlgorithms.Optimization.Modeling.LinearTerm | Stores one coefficient of a portable linear expression |
| CULSAlgorithms.Optimization.Modeling.LinearVariable | Describes one variable in a portable linear mathematical model |
| CULSAlgorithms.Optimization.OptimizationSolverDiscovery | High-level entry point used by solver-backed ULS algorithms to discover and select a mathematical optimizer automatically |
| CULSAlgorithms.Optimization.SolverAdapterRegistry | Stores optimization-solver adapters and provides deterministic lookup by adapter identifier and solver kind |
| CULSAlgorithms.Optimization.SolverAvailabilityInfo | Describes solver availability and the installation selected by an adapter |
| CULSAlgorithms.Optimization.SolverDiscoveryReport | Complete availability snapshot for all built-in solver adapters |
| CULSAlgorithms.Optimization.SolverExecutionInfo | Serializable-style immutable snapshot of the solver selected for one solver-backed ULS execution |
| CULSAlgorithms.Optimization.SolverSelectionOptions | Configures automatic or explicit optimization-solver selection |
| CULSAlgorithms.Optimization.SolverSelectionResult | Describes the outcome of optimization-solver selection |
| CULSAlgorithms.Optimization.SolverSelectionService | Selects a usable optimization solver by capability, machine availability, and deterministic priority |
| CULSAlgorithms.Results.UlsSolution | Represents a feasible production plan for a ULS problem |
| CULSAlgorithms.Results.UlsSolveResult | Represents the outcome returned by a ULS solution strategy |
| CULSAlgorithms.Results.AdaptiveExactUlsSolveResult | Solve result returned by the adaptive exact strategy |
| CULSAlgorithms.Results.CuttingPlaneUlsSolveResult | ULS result enriched with the complete (l,S) cut-generation report |
| CULSAlgorithms.Results.SolverBackedUlsSolveResult | ULS solve result enriched with mathematical-formulation and optimization engine provenance |
| CULSAlgorithms.Selection.UlsProblemAnalyzer | Computes solver-selection characteristics for a validated ULS problem |
| CULSAlgorithms.Selection.UlsProblemCharacteristics | Describes inexpensive structural and cost characteristics used to select an exact ULS solution strategy |
| CULSAlgorithms.ULSAlgorithmsInfo | Exposes stable runtime metadata for the ULSAlgorithms assembly |
| CULSAlgorithms.Validation.UlsSolutionValidationResult | Independent ULS-domain validation report for one production plan |
| CULSAlgorithms.Validation.UlsSolutionValidator | Independently verifies a ULS production plan against the original UlsProblem |
1.17.0 