Items related to Discrete and Fractional Programming Techniques for...
Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2013
- ISBN 10 1461368243
- ISBN 13 9781461368243
- BindingPaperback
- LanguageEnglish
- Number of pages198
Search results for Discrete and Fractional Programming Techniques for...
Stock Image
Discrete and Fractional Programming Techniques for Location Models (Combinatorial Optimization, 3)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461368243_new
Quantity: Over 20 available
Seller Image
Discrete and Fractional Programming Techniques for Location Models
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 200 pp. Englisch. Seller Inventory # 9781461368243
Quantity: 2 available
Stock Image
Discrete and Fractional Programming Techniques for Location Models
Published by
Springer-Verlag New York Inc., 2013
ISBN 10: 1461368243
ISBN 13: 9781461368243
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 344. Seller Inventory # C9781461368243
Quantity: Over 20 available
Seller Image
Discrete and Fractional Programming Techniques for Location Models
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9781461368243
Quantity: 1 available
Seller Image
Discrete and Fractional Programming Techniques for Location Models
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4194987
Quantity: Over 20 available
Stock Image
Discrete and Fractional Programming Techniques for Location Models
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reprint edition. 198 pages. 9.25x6.10x0.46 inches. In Stock. Seller Inventory # x-1461368243
Quantity: 2 available
Stock Image
Discrete and Fractional Programming Techniques for Location Models
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 200 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 131520518
Quantity: 4 available
Stock Image
Discrete and Fractional Programming Techniques for Location Models
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 200. Seller Inventory # 26128018393
Quantity: 4 available
Seller Image
Discrete and Fractional Programming Techniques for Location Models
Published by
Springer US, Springer New York Nov 2013, 2013
ISBN 10: 1461368243
ISBN 13: 9781461368243
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 200 pp. Englisch. Seller Inventory # 9781461368243
Quantity: 1 available
Stock Image
Discrete and Fractional Programming Techniques for Location Models
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 200. Seller Inventory # 18128018387
Quantity: 4 available