Min-max optimization of several classical discrete optimization problems
type: Item
instance of: scholarly article
title: Min-max optimization of several classical discrete optimization problems
zbMATH Open document ID: 0908.90220
DOI: 10.1023/A:1022601301102
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-02-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 49J35
zbMATH DE Number: 1206574
zbMATH Keywords: min-max discrete optimization
zbMATH Keywords: computational complexity
zbMATH Keywords: pseudopolynomial algorithms
MaRDI profile type: Publication
cites work: Q4286721
cites work: Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
cites work: A graphical method to solve a maximin allocation problem
cites work: Resource allocation among competing activities: A lexicographic minimax approach
cites work: A min-max resource allocation problem with substitutions
cites work: A nonlinear minimax allocation problem with multiple knapsack constraints
cites work: Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
cites work: On Marginal Allocation in Single Constraint Min-Max Problems
cites work: More on Min-Max Allocation
cites work: Technical Note—On Min-Max Integer Allocation Problems
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
cites work: An O\((n \log{}n)\) algorithm for a maxmin location problem
cites work: A shifting algorithm for constrained min-max partition on trees
cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
cites work: Continuous maximin knapsack problems with GLB constraints
cites work: Complexity results for a class of min-max problems with robust optimization applications
cites work: An algorithm for separable nonlinear minimax problems
cites work: Linear max-min programming
cites work: An algorithm for solving linearly constrained minimax problems
cites work: Minimax linear programming problem
cites work: New algorithms for constrained minimax optimization
cites work: Linearly constrained minimax optimization
cites work: Trajectory-following algorithms for min-max optimization problems
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
description: scientific article; zbMATH DE number 1206574