Scheduling Personnel Retraining: Column Generation Heuristics

DOI10.1007/978-3-319-45587-7_19zbMath1451.90083OpenAlexW2517163011MaRDI QIDQ2835678

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

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_19

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Uses Software

• Knapsack

Cites Work

• Cutting plane algorithms for solving a stochastic edge-partition problem
• Min-cut clustering
• 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
• Exact Solution of the Quadratic Knapsack Problem
• The SONET edge‐partition problem
• A Primer in Column Generation

This page was built for publication: Scheduling Personnel Retraining: Column Generation Heuristics