English  |  正體中文  |  简体中文  |  Items with full text/Total items : 43312/67235
Visitors : 2024907      Online Users : 2
RC Version 5.0 © Powered By DSPACE, MIT. Enhanced by NTU/NCHU Library IR team.

Please use this identifier to cite or link to this item: http://nchuir.lib.nchu.edu.tw/handle/309270000/156286

標題: 1-segment Center Problems
作者: H.Imai;D.T.Lee;C.D.Yang
關鍵字: facilities/equipment planning;discrete facility location;analysis of algorithms: computational complexity;computational geometry: geometric location;minimax optimization;computational geometry;geometric facility location;minimax optimization
日期: 1992
Issue Date: 2014-03-24 09:13:17 (UTC+8)
摘要: We consider a minimax facility location problem for n points such that the facility is a line segment of a given length. The general problem can be solved by case analysis in O(n4 log n) time. When the orientation of the segment is fixed, the problem is shown to be linear-time solvable by using the prune-and-search technique. Other variations of this problem are also discussed.
Relation: ORSA J. Computing., Volume�4, Issue�4, Page(s) �426-434.
Appears in Collections:[依教師分類] 李德財
[依資料類型分類] 期刊論文

loading Web of Knowledge data....

Files in This Item:

There are no files associated with this item.



 


學術資源

著作權聲明

本網站為收錄中興大學學術著作及學術產出,已積極向著作權人取得全文授權,並盡力防止侵害著作權人之權益。如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員,將盡速為您處理。

本網站之數位內容為國立中興大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用。

聯絡網站維護人員:wyhuang@nchu.edu.tw,04-22840290 # 412。

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU/NCHU Library IR team Copyright ©   - Feedback