Planning personnel retraining: column generation heuristics

DOI10.1007/s10878-018-0253-2zbMath1414.90232OpenAlexW2788202545MaRDI QIDQ1631648

Oliver G. Czibula, Yakov Zinder, Han-Yu Gu

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0253-2

zbMATH Keywords

integer programmingcolumn generationheuristiclarge neighbourhood searchpersonnel retraining

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Cutting plane algorithms for solving a stochastic edge-partition problem
• Optimizing simulated annealing schedules with genetic programming
• Min-cut clustering
• A computational study on the quadratic knapsack problem with multiple constraints
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• The partition problem
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• A New Genetic Algorithm for the Quadratic Assignment Problem
• Exact Solution of the Quadratic Knapsack Problem
• The SONET edge‐partition problem
• Production Planning by Mixed Integer Programming
• A Primer in Column Generation

This page was built for publication: Planning personnel retraining: column generation heuristics