Constraint satisfaction methods for solving the staff transfer problem

DOI10.1007/BF03398729zbMath1160.90500MaRDI QIDQ2476428

Amitava Bagchi, Sriyankar Acharyya

Publication date: 19 March 2008

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

simulated annealinggenetic algorithmssatisfiabilityhuman resource managementconflict directed backjumpingGSAT

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Matching formulation of the staff transfer problem: meta-heuristic approaches

Cites Work

• A theoretical evaluation of selected backtracking algorithms.
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constraint satisfaction methods for solving the staff transfer problem