On a general network location--production--allocation problem

DOI10.1016/0377-2217(91)90189-3zbMath0744.90047OpenAlexW2051047596MaRDI QIDQ1183612

Ching-Chung Kuo, S. Louis Hakimi

Publication date: 28 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90189-3

zbMATH Keywords

heuristic algorithmsnetwork location-production-allocation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Discrete location and assignment (90B80)

Related Items (2)

Approximation algorithms for the capacitated plant allocation problem ⋮ A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Theory of Search: Optimum Distribution of Search Effort
• A General Algorithm for the Optimal Distribution of Effort
• An Overview of Representative Problems in Location Research
• Technical Note—Allocation of Effort Resources among Competing Activities
• Multicommodity Distribution System Design by Benders Decomposition
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• The Optimum Distribution of Effort
• A Graph-Theoretic Approach to a Class of Integer-Programming Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: On a general network location--production--allocation problem