A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems (Q2840764): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An effective heuristic for the CLSP with set-up times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variable neighborhood search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems / rank | |||
Normal rank |
Latest revision as of 15:28, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems |
scientific article |
Statements
A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems (English)
0 references
23 July 2013
0 references
multi-level capacitated lot-sizing (MLCLSP)
0 references
variable neighborhood decomposition search
0 references
accurate mixed integer programming
0 references
0 references