Publication:3437242

zbMath1123.49027MaRDI QIDQ3437242

Moshe Sniedovich, Stefan Voß

Publication date: 14 May 2007

Full work available at URL: https://eudml.org/doc/209435

zbMATH Keywords

dynamic programming; corridor method; method-based local search; method-based neighbourhoods

Mathematics Subject Classification ID

49L20: Dynamic programming in optimal control and differential games

90C39: Dynamic programming

Related Items

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks, POPMUSIC as a matheuristic for the berth allocation problem, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2), MILP-based heuristics for the design of rural community electrification projects, A hybrid algorithm for the DNA sequencing problem, Applying the corridor method to a blocks relocation problem, Models for a traveling purchaser problem with additional side-constraints, A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations, Generalized local branching heuristics and the capacitated ring tree problem, Integer programming models for the pre-marshalling problem, A dynamic programming-based matheuristic for the dynamic berth allocation problem, A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing