Reducibility of minimax to minisum 0–1 programming problems
- 28 February 1981
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 6 (2), 125-132
- https://doi.org/10.1016/0377-2217(81)90198-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Medi-Centers of a TreeTransportation Science, 1985
- Selected Families of Location ProblemsAnnals of Discrete Mathematics, 1979
- Efficient Solutions in Multiobjective Tree Network Location ProblemsTransportation Science, 1978
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a GraphManagement Science, 1978
- Computer-aided layout designPublished by Springer Nature ,1978
- An algebraic approach to assignment problemsMathematical Programming, 1977
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE*Journal of Regional Science, 1976
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961