Employee workload balancing by graph partitioning

DOI10.1016/j.dam.2013.02.014zbMath1288.05289OpenAlexW2020060650MaRDI QIDQ2448894

Fabio Colombo, Alberto Ceselli, Marco Trubian, Roberto Cordone

Publication date: 5 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.014

zbMATH Keywords

tabu searchgraph partitioningvery large scale neighbourhood search

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Signed and weighted graphs (05C22)

Related Items

Rethinking structural balance in signed social networks, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, Column-generation based bounds for the homogeneous areas problem

Uses Software

• KaFFPa
• Tabu search

Cites Work

• Unnamed Item
• The case for strategic oscillation
• Sparsest cuts and bottlenecks in graphs
• Packing and partitioning orbitopes
• The node capacitated graph partitioning problem: A computational study
• Future paths for integer programming and links to artificial intelligence
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Linear and quadratic programming approaches for the general graph partitioning problem
• Approximation algorithms for minimum \(K\)-cut
• Engineering Multilevel Graph Partitioning Algorithms
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Lower Bounds for the Partitioning of Graphs