Reducibility of minimax to minisum 0-1 programming problems
type: Item
instance of: scholarly article
title: Reducibility of minimax to minisum 0-1 programming problems
zbMATH Open document ID: 0451.90084
DOI: 10.1016/0377-2217(81)90198-3
author: Jakob Krarup
author: Peter Mark Pruzan
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 3706238
zbMATH Keywords: reducibility of minimax
zbMATH Keywords: minisum
zbMATH Keywords: minimax objective function
zbMATH Keywords: linear minisum problem
zbMATH Keywords: locational decision models
zbMATH Keywords: algorithm
zbMATH Keywords: p-center
zbMATH Keywords: p- median
zbMATH Keywords: location
zbMATH Keywords: logistics
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90198-3
OpenAlex ID: W1989136350
cites work: An algebraic approach to assignment problems
cites work: Q3905087
cites work: Q4083324
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
cites work: Medi-Centers of a Tree
cites work: Q3316922
cites work: Q3048590
cites work: Selected Families of Location Problems
cites work: The Backboard Wiring Problem: A Placement Algorithm
description: scientific article; zbMATH DE number 3706238