scientific article

zbMath1123.49027MaRDI QIDQ3437242

Moshe Sniedovich, Stefan Voß

Publication date: 14 May 2007

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingcorridor methodmethod-based local searchmethod-based neighbourhoods

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39)

Related Items (16)

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 dynamic programming-based matheuristic for the dynamic berth allocation problem ⋮ Matheuristics: survey and synthesis ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ A hybrid algorithm for the DNA sequencing problem ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations ⋮ Applying the corridor method to a blocks relocation problem ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Integer programming models for the pre-marshalling problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

This page was built for publication: