<電子ブック>
Discrete and Fractional Programming Techniques for Location Models / by A.I. Barros
(Combinatorial Optimization ; 3)
版 | 1st ed. 1998. |
---|---|
出版者 | (New York, NY : Springer US : Imprint: Springer) |
出版年 | 1998 |
本文言語 | 英語 |
大きさ | XVIII, 180 p : online resource |
著者標目 | *Barros, A.I author SpringerLink (Online service) |
件 名 | LCSH:Mathematical optimization LCSH:Calculus of variations LCSH:Algorithms LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics FREE:Calculus of Variations and Optimization FREE:Optimization FREE:Algorithms FREE:Discrete Mathematics in Computer Science FREE:Discrete Mathematics |
一般注記 | At first sight discrete and fractional programming techniques appear to be two com pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Location analysis deals with the problem of deciding where to locate facilities, con sidering the clients to be served, in such a way that a certain criterion is optimized. The term "facilities" immediately suggests factories, warehouses, schools, etc. , while the term "clients" refers to depots, retail units, students, etc. Three basic classes can be identified in location analysis: continuous location, network location and dis crete location. The differences between these fields arise from the structure of the set of possible locations for the facilities. Hence, locating facilities in the plane or in another continuous space corresponds to a continuous location model while finding optimal facility locations on the edges or vertices of a network corresponds to a net work location model. Finally, if the possible set of locations is a finite set of points we have a discrete location model. Each of these fields has been actively studied, arousing intense discussion on the advantages and disadvantages of each of them. The usual requirement that every point in the plane or on the network must be a candidate location point, is one of the mostly used arguments "against" continuous and network location models HTTP:URL=https://doi.org/10.1007/978-1-4615-4072-4 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9781461540724 |
|
電子リソース |
|
EB00231711 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA402.5-402.6 LCC:QA315-316 DC23:519.6 DC23:515.64 |
書誌ID | 4000106352 |
ISBN | 9781461540724 |
類似資料
この資料の利用統計
このページへのアクセス回数:4回
※2017年9月4日以降