Reducibility of minimax to minisum 0-1 programming problems

DOI10.1016/0377-2217(81)90198-3zbMath0451.90084OpenAlexW1989136350MaRDI QIDQ1148229

Peter Mark Pruzan, Jakob Krarup

Publication date: 1981

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

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

zbMATH Keywords

algorithmlocationminimax objective functionlogisticsminisump-centerp- medianlinear minisum problemlocational decision modelsreducibility of minimax

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items (11)

Zero-one programming with multiple criteria ⋮ Location problems with costs being sums of powers of Euclidean distances ⋮ Simultaneous location-allocation of facilities and servers. a generalized heuristic ⋮ The impact of distance on location problems ⋮ Generalized multiple objective bottleneck problems ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ On locating new facilities in a competitive environment ⋮ Quadratic bottleneck problems ⋮ On the lexicographic minimax approach to location problems ⋮ The simple plant location problem: Survey and synthesis ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selected Families of Location Problems
• The Backboard Wiring Problem: A Placement Algorithm
• Medi-Centers of a Tree
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An algebraic approach to assignment problems
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph

This page was built for publication: Reducibility of minimax to minisum 0-1 programming problems