A column generation heuristic for a dynamic generalized assignment problem

DOI10.1016/j.cor.2008.11.022zbMath1179.90210MaRDI QIDQ1010279

Maria Flavia Monaco, Marcello Sammarra, Jean-François Cordeau, Luigi Moccia

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.022

zbMATH Keywords

column generation; generalized assignment problem; warehouse management; yard management; dynamic problem

Mathematics Subject Classification ID

90C39: Dynamic programming

90B80: Discrete location and assignment

Related Items

Sparse conjugate directions pursuit with application to fixed-size kernel models, Optimizing yard assignment in an automotive transshipment terminal, Repulsive assignment problem, Simultaneous berth allocation and yard planning at tactical level

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The service allocation problem at the Gioia Tauro maritime terminal
• Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope
• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• Algorithms for the Weight Constrained Shortest Path Problem
• A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Dynamic space allocation for temporary storage
• Column Generation