Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

The capacitated multiple allocation hub location problem: formulations and algorithms

Article Abstract:

A new mixed integer linear programming formulation is utilized for the capacitated multiple allocation hub location problem. There are fewer restrictions and variables and new formulations of the problem is developed. These new formulations work more quickly than older formulations but they have not been tested on major real world problems, only small- and medium-sized problems.

Author: Ebery, Jamie, Krishnamoorthy, Mohan, Ernst, Andreas, Boland, Natashia
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
Australia, Statistical Data Included, Tests, problems and exercises

User Contributions:

1
elham
Report this comment as inappropriate
Jan 27, 2010 @ 3:03 am
i need to know what is hub location for my research.

Comment about this article or add new information about this topic:

CAPTCHA


Preprocessing and cutting for multiple allocation hub location problems

Article Abstract:

Formulations and solution approaches for multiple allocation hub location problems are discussed. A number of results that enable to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations are presented.

Author: Ebery, Jamie, Krishnamoorthy, Mohan, Boland, Natashia, Ernst, Andreas T.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
Management dynamics, Methods, Management, Integer programming, Company business management, ATM LAN hub/MAU

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Solving large single allocation p-hub problems with two or three hubs

Article Abstract:

Research is presented concerning the utilization of mixed integer linear programming formulations to solve variants of the p-hub allocation problem and the uncapacitated single allocation p-hub median problem.

Author: Ebery, Jamie
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Operations Research, Research, Usage, Industrial locations, Industrial location, Branch and bound algorithms, Allocation (Accounting)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Linear programming, Network hubs
Similar abstracts:
  • Abstracts: AHP-based evaluation of AHP-software. Software evaluation problem situations. On evaluating the performance of GSS: furthering the debate, by Paul Finlay
  • Abstracts: Import motivation in manufacturer-overseas distributor relationships: guidelines for U.S. industrial exporters
  • Abstracts: Integration of operation routing and economic production quantity decisions in batch manufacturing systems. Optimal production run length for products sold with warranty
  • Abstracts: An evolutionary approach for finding optimal trees in undirected networks. Use of location-allocation models in health service development planning in developing nations
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.