The multi-service center problem

DOI10.1007/978-3-642-35261-4_60zbMATH Open1260.90119OpenAlexW195500836MaRDI QIDQ4909574FDOQ4909574

Cheng-Chung Li, Hung-I Yu

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

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

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)

Cited In (9)

• Complexity of the multi-service center problem
• Complexity of the multi-service center problem
• Title not available (Why is that?)
• 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-hour service system design problem
• Title not available (Why is that?)
• Locating Facilities on a Network to Minimize Their Average Service Radius

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)