𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale

✍ Scribed by John G. Klincewicz

Book ID
110398649
Publisher
Springer US
Year
2002
Tongue
English
Weight
111 KB
Volume
110
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch and cut algorithm for hub locat
A branch and cut algorithm for hub location problems with single assignment
✍ Martine LabbΓ©; Hande Yaman; Eric Gourdin πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra

A real time algorithm for the location s
A real time algorithm for the location search of discontinuous conductivities with one measurement
✍ Ohin Kwon; Jin Keun Seo; Jeong-Rock Yoon πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 292 KB

## Abstract We consider an inverse problem for finding the anomaly of discontinuous electrical conductivity by one current‐voltage observation. We develop a real time algorithm for determining the location of the anomaly. This new idea is based on the observation of the pattern of a simple weighted