A bicriterion call center problem through an evolved branch and bound algorithm

DOI10.1007/s12597-011-0057-yzbMath1353.90079OpenAlexW1986378598MaRDI QIDQ505103

Renu Tuli, Peeyush Pant, Satya Prakash, Anuj Gupta, Anil Kumar Agrawal, Leena Singh

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-011-0057-y

zbMATH Keywords

clusteringbranch and bound algorithmefficient solutionmulticriteria optimizationcall center

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (2)

Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized ⋮ A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition

Cites Work

• Optimizing dead mileage in urban bus routes through a nondominated solution approach
• Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
• Pareto optimal solutions of a cost-time trade-off bulk transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bicriterion call center problem through an evolved branch and bound algorithm