A note on the location of an obnoxious facility on a network
Article Abstract:
Issues relating to the maximin problem are examined in detail, in the context of an obnoxious facility and its location on a network.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
The gradual covering decay location problem on a network
Article Abstract:
A generalization of the maximal cover location problem (MCLP) model is presented where two coverage radii l and u are defined for each demand point. The advantages of the formulation obtained with this technique are illustrated with examples.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2003
User Contributions:
Comment about this article or add new information about this topic:
The plant location problem with demand-dependent setup costs and centralized allocation
Article Abstract:
A model is is derived to analyze the traditional plant location problem wherein the setup costs of a facility are dependent on the number of customers served by the facility and centralized allocation of customer to facilities is assumed. The model is formulated as a mixed integer programming problem in the case of a general network while a polynomial algorithm is developed to solve the problem on a tree network.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Scheduling about a common due date with job dependent asymmetric earliness and tardiness penalties. A genetic algorithm for scheduling staff of mixed skills under multi-criteria
- Abstracts: Solving an assignment-selection problem with verbal information and using genetic algorithms. Economic expectations, fuzzy sets and financial planning
- Abstracts: Single machine group scheduling with resource dependent setup and processing times. Minimizing maximum lateness under linear deterioration
- Abstracts: A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets. New stopping criterion for genetic algorithms
- Abstracts: Corruption 'witch-hunt' or just cause? Lai is at center of a Beijing crackdown. Executive of China's Sinopec unit is issued death sentence