A column generation heuristic for a dynamic generalized assignment problem

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

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

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 generationgeneralized assignment problemwarehouse managementyard managementdynamic problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (12)

The terminal-oriented ship stowage planning problem ⋮ Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems ⋮ A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension ⋮ A note of reduced dimension optimization algorithm of assignment problem ⋮ Fleet management: a vehicle and driver assignment model ⋮ Sparse conjugate directions pursuit with application to fixed-size kernel models ⋮ Optimizing yard assignment in an automotive transshipment terminal ⋮ Simultaneous berth allocation and yard planning at tactical level ⋮ Dynamic job assignment: a column generation approach with an application to surgery allocation ⋮ Repulsive assignment problem ⋮ Formulations for a problem of petroleum transportation ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A column generation heuristic for a dynamic generalized assignment problem