Lower bounds for the Hub Location Problem
Article Abstract:
The Hub Location Problem (HLP) where distances satisfy the triangle inequality is considered. A unique connection is established between an upper and a lower bounding method in the context of this problem, and this consequently creates a new lower bound that improves on the known lower bound. It is shown that it is theoretically possible to make this improvement by using a known heuristic solution called the reference solution. By applying two different reference solutions, the best heuristic for HLP and the optimal solution to the linear integer programming problem, the new lower bound is derived. This new lower bound minimizes the differences between the upper and lower bound for problem sets with 10 to 15 nodes to an average of 3.3% and to an average of 5.9% for sets with 20 to 25 nodes.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
Network competition and the timing of commercials
Article Abstract:
A study was conducted to examine equilibrium in monopolistic competition associated with television networks using statistical analysis and a theoretical framework on the timing of commercials. The number of viewers watching a channel was determined using the day, hour, type and length of the television program. The broadcasting unit was defined as the total time between the beginning of a program and the start of the next program. A number of assumptions were also considered in the study which considered the relationship between the number and length of commercials with television viewership. Results showed that variances in commercial broadcasting were directly proportional to the progress of the television program.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An Analysis of Network Location Problems with Distance Constraints. COMMUNITIES ON THE PENTAGON'S HIT LIST
- Abstracts: On the sequential selection problem. Customer learning processes, strategy selection, and performance in business-to-business service firms
- Abstracts: NCR Introduces First Retail PC. Reflections on the Past, Present and Future of Retail Computer Technology
- Abstracts: Organizational simulation and information systems design: an operations level example