Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

RLP: a program package for solving restricted 1-facility location problems in a user friendly environment

Article Abstract:

The Restricted Location Problem software is a combination of popular algorithms for solving 1-facility location problems in the plane. It also includes new procedures for solving restricted location problems. The entire solving process involves the Make Restricted Location Problems which aids the user in describing the problem and the Restricted Median Problem for Windows or the Restricted Problem for Windows which can be accommodated by a Microsoft Windows program. Problems involving 100 facilites can be supported by the program.

Author: Nickel, S., Hamacher, H.W.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Evaluation, Performance analysis software, Restricted Location Problems (Performance analysis software)

User Contributions:

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

CAPTCHA


Codes of geometrical algorithms for the (weighted) minimum circle problem

Article Abstract:

Two codes based on the Elzinga-Hearn algorithm are presented as solutions to the weighted minimum circle problem. Formula translator-based COVER and WTDCOVER codes have been developed by Donald W. Hearn and James Vijay. Another code, ELZINGA-HEARN (C), has been developed by S. Nickel for the same problem type. These codes for geometrical algorithms all exhibit computational efficiency in solving the specified problem.

Author: Hamacher, H.W.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Information management, FORTRAN (Programming language), FORTRAN

User Contributions:

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

CAPTCHA


Multicriteria planar location problems

Article Abstract:

A general model for multiobjective single-facility location problems of the lexicographic, Pareto and max ordering (MO) type was constructed. Specifically, lexicographic, Pareto and MO locations were characterized using the squared Euclidean distance as the distance function. In addition, polynomial algorithms based on restricted location theory were developed for solving the three problems.

Author: Nickel, S., Hamacher, H.W.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Research, Case studies, Industrial sites, Industrial locations, Industrial location

User Contributions:

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

CAPTCHA


Subjects list: Operations research, Management science
Similar abstracts:
  • Abstracts: Paris Hyatt goes for Jahn to design new atrium hotel. Quick-fit canopy to raise the profile of historic project
  • Abstracts: Marketing practices in the changing Philippine macroeconomic environment. Macroeconomic conditions and international marketing management
  • Abstracts: Brand positioning under lexicographic choice rules. Location analysis: a synthesis and survey. The use of domains in multicriteria decision making
  • Abstracts: Estimation of returns to scale using data envelopment analysis. Analysis of trends in technical and allocative efficiency: an application to Texas public school districts
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.