Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3) - Image 1

£83.81

Springer Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3)

Name: Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3)
Brand: Springer
Price: 83.81 GBP
Availability: InStock

Algorithms

This is the usual price. Wait for it to drop, or tell us your number.

£84 today · usual range £0–£0 · best ever £70

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 637 days • 637 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 637 days • 10 price levels

Days at Price

Current Price

Price Analysis

Most common price: £83 (416 days, 65.3%)

Price range: £70 - £100

Price levels: 10 different prices over 637 days

Description

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.

Key Features

Used Book in Good Condition

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 0792350022
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 30 April 1998
Listed Since: 15 December 2006

Barcode

No barcode data available

Springer Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Discrete Location Theory: 23 (Wiley Series in Discrete Mathematics and Optimization)

Network and Discrete Location: Models, Algorithms, and Applications

CRC Press Operations Planning: Mixed Integer Optimization Models

Optimal Districting and Territory Design: 284 (International Series in Operations Research & Management Science, 284)

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Recent Advances in Global Optimization (Princeton Legacy Library)

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems: 39 (International Series in Operations Research & Management Science, 39)

Handbook of Optimization Theory: Decision Analysis & Application (Mathematics Research Developments Series)

Local Search in Combinatorial Optimization

Heuristics for Optimization and Learning: 906 (Studies in Computational Intelligence, 906)

Modelling Empty Container Repositioning Logistics

Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)

Optimization in Large Scale Problems: Industry 4.0 and Society 5.0 Applications: 152 (Springer Optimization and Its Applications, 152)

Metaheuristics for Scheduling in Industrial and Manufacturing Applications: 128 (Studies in Computational Intelligence, 128)

Ant Colony Optimization and Applications: 947 (Studies in Computational Intelligence, 947)

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network: 3 (Springer Optimization and Its Applications, 3)

Modelling Empty Container Repositioning Logistics

A Modern Approach to Teaching an Introduction to Optimization (Foundations and Trends® in Optimization)

Springer Fuzzy-Like Multiple Objective Multistage Decision Making

Springer Intelligent Computational Optimization in Engineering

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing: 21 (Wiley Series in Discrete Mathematics & Optimization)