The multi-service center problem

DOI10.1007/978-3-642-35261-4_60MaRDI QIDQ4909574zbMATH OpenOpenAlexFDO

Authors Hung-I Yu, Cheng-Chung Li

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_60

zbMATH Keywords

treespathslocation theorygeneral graphs\(p\)-service center

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25) Distance in graphs (05C12) Discrete location and assignment (90B80)

Recommendations

• The multi-service center problem
• Complexity of the multi-service center problem
• Complexity of the multi-service center problem
• The \(k\)-centrum multi-facility location problem
• scientific article; zbMATH DE number 591341

Cited in

(13)

• Locating Facilities on a Network to Minimize Their Average Service Radius
• k-balanced center location problem: a new multi-objective facility location problem
• Complexity of the multi-service center problem
• Complexity of the multi-service center problem
• scientific article; zbMATH DE number 125274 (Why is no real title available?)
• Bounded fan-out \(m\)-center problem
• Front-office multitasking between service encounters and back-office tasks
• The \(k\)-centrum multi-facility location problem
• One-way and round-trip center location problems
• The multi-service center problem
• The multi-hour service system design problem
• scientific article; zbMATH DE number 591341 (Why is no real title available?)
• The multiple server center location problem

This page was built for publication: The multi-service center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909574)