Discrete and fractional programming techniques for location models:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Springer Science+Business Media, B.V.
[2013]
|
| Ausgabe: | Softcover reprint of the hardcover 1st edition 1998 |
| Schriftenreihe: | Combinatorial Optimization
3 |
| Schlagworte: | |
| Beschreibung: | 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 |
| Beschreibung: | xviii, 178 Seiten Illustrationen |
| ISBN: | 9781461368243 |
| ISSN: | 1388-3011 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV047025101 | ||
| 003 | DE-604 | ||
| 005 | 20210112 | ||
| 007 | t | ||
| 008 | 201124s2013 a||| m||| 00||| eng d | ||
| 020 | |a 9781461368243 |c Softcover |9 978-1-4613-6824-3 | ||
| 035 | |a (OCoLC)1231962742 | ||
| 035 | |a (DE-599)BVBBV047025101 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 082 | 0 | |a 515.64 |2 23 | |
| 100 | 1 | |a Barros, Ana Isabel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Discrete and fractional programming techniques for location models |c by Ana Isabel Barros |
| 250 | |a Softcover reprint of the hardcover 1st edition 1998 | ||
| 264 | 1 | |a Dordrecht |b Springer Science+Business Media, B.V. |c [2013] | |
| 300 | |a xviii, 178 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Combinatorial Optimization |v 3 |x 1388-3011 | |
| 500 | |a 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 | ||
| 502 | |b Dissertation |c Erasmus University Rotterdam |d 1995 |g Überarbeitete Fassung | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Calculus of Variations and Optimal Control; Optimization | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Mathematik | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4615-4072-4 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 0-7923-5002-2 |
| 830 | 0 | |a Combinatorial Optimization |v 3 |w (DE-604)BV012009079 |9 3 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032432493 | ||
Datensatz im Suchindex
| _version_ | 1804181992979300352 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Barros, Ana Isabel |
| author_facet | Barros, Ana Isabel |
| author_role | aut |
| author_sort | Barros, Ana Isabel |
| author_variant | a i b ai aib |
| building | Verbundindex |
| bvnumber | BV047025101 |
| ctrlnum | (OCoLC)1231962742 (DE-599)BVBBV047025101 |
| dewey-full | 515.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 515 - Analysis |
| dewey-raw | 515.64 |
| dewey-search | 515.64 |
| dewey-sort | 3515.64 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| edition | Softcover reprint of the hardcover 1st edition 1998 |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03186nam a2200469zcb4500</leader><controlfield tag="001">BV047025101</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210112 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">201124s2013 a||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461368243</subfield><subfield code="c">Softcover</subfield><subfield code="9">978-1-4613-6824-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1231962742</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047025101</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">515.64</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barros, Ana Isabel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete and fractional programming techniques for location models</subfield><subfield code="c">by Ana Isabel Barros</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Softcover reprint of the hardcover 1st edition 1998</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Science+Business Media, B.V.</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xviii, 178 Seiten</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Combinatorial Optimization</subfield><subfield code="v">3</subfield><subfield code="x">1388-3011</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Erasmus University Rotterdam</subfield><subfield code="d">1995</subfield><subfield code="g">Überarbeitete Fassung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Calculus of Variations and Optimal Control; Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4615-4072-4</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">0-7923-5002-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Combinatorial Optimization</subfield><subfield code="v">3</subfield><subfield code="w">(DE-604)BV012009079</subfield><subfield code="9">3</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032432493</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047025101 |
| illustrated | Illustrated |
| index_date | 2024-07-03T16:00:39Z |
| indexdate | 2024-07-10T09:00:28Z |
| institution | BVB |
| isbn | 9781461368243 |
| issn | 1388-3011 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032432493 |
| oclc_num | 1231962742 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | xviii, 178 Seiten Illustrationen |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Springer Science+Business Media, B.V. |
| record_format | marc |
| series | Combinatorial Optimization |
| series2 | Combinatorial Optimization |
| spelling | Barros, Ana Isabel Verfasser aut Discrete and fractional programming techniques for location models by Ana Isabel Barros Softcover reprint of the hardcover 1st edition 1998 Dordrecht Springer Science+Business Media, B.V. [2013] xviii, 178 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Combinatorial Optimization 3 1388-3011 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 Dissertation Erasmus University Rotterdam 1995 Überarbeitete Fassung Mathematics Computational complexity Algorithms Combinatorics Mathematical optimization Calculus of Variations and Optimal Control; Optimization Optimization Discrete Mathematics in Computer Science Mathematik (DE-588)4113937-9 Hochschulschrift gnd-content Erscheint auch als Online-Ausgabe 978-1-4615-4072-4 Erscheint auch als Druck-Ausgabe, Hardcover 0-7923-5002-2 Combinatorial Optimization 3 (DE-604)BV012009079 3 |
| spellingShingle | Barros, Ana Isabel Discrete and fractional programming techniques for location models Combinatorial Optimization Mathematics Computational complexity Algorithms Combinatorics Mathematical optimization Calculus of Variations and Optimal Control; Optimization Optimization Discrete Mathematics in Computer Science Mathematik |
| subject_GND | (DE-588)4113937-9 |
| title | Discrete and fractional programming techniques for location models |
| title_auth | Discrete and fractional programming techniques for location models |
| title_exact_search | Discrete and fractional programming techniques for location models |
| title_exact_search_txtP | Discrete and fractional programming techniques for location models |
| title_full | Discrete and fractional programming techniques for location models by Ana Isabel Barros |
| title_fullStr | Discrete and fractional programming techniques for location models by Ana Isabel Barros |
| title_full_unstemmed | Discrete and fractional programming techniques for location models by Ana Isabel Barros |
| title_short | Discrete and fractional programming techniques for location models |
| title_sort | discrete and fractional programming techniques for location models |
| topic | Mathematics Computational complexity Algorithms Combinatorics Mathematical optimization Calculus of Variations and Optimal Control; Optimization Optimization Discrete Mathematics in Computer Science Mathematik |
| topic_facet | Mathematics Computational complexity Algorithms Combinatorics Mathematical optimization Calculus of Variations and Optimal Control; Optimization Optimization Discrete Mathematics in Computer Science Mathematik Hochschulschrift |
| volume_link | (DE-604)BV012009079 |
| work_keys_str_mv | AT barrosanaisabel discreteandfractionalprogrammingtechniquesforlocationmodels |