Min-max optimization of several classical discrete optimization problems
From MaRDI portal
Publication:1265052
DOI10.1023/A:1022601301102zbMath0908.90220MaRDI QIDQ1265052
Publication date: 28 February 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Existence of solutions for minimax problems (49J35)
Related Items (12)
Robust production and transportation planning in thin film transistor-liquid crystal display (TFT-LCD) industry under demand and price uncertainties ⋮ Stochastic linear programming games with concave preferences ⋮ Minimising maximum response time ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ Linear optimization with bipolar max-min constraints ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ Approximating max-min weighted \(T\)-joins ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ A minmax regret linear regression model under uncertainty in the dependent variable ⋮ Dynamic linear programming games with risk-averse players ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Reference variable methods of solving min-Max optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A shifting algorithm for constrained min-max partition on trees
- Minimax linear programming problem
- A graphical method to solve a maximin allocation problem
- Resource allocation among competing activities: A lexicographic minimax approach
- An algorithm for separable nonlinear minimax problems
- An algorithm for solving linearly constrained minimax problems
- A nonlinear minimax allocation problem with multiple knapsack constraints
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- A min-max resource allocation problem with substitutions
- Trajectory-following algorithms for min-max optimization problems
- Continuous maximin knapsack problems with GLB constraints
- Technical Note—On Min-Max Integer Allocation Problems
- A Max-Min Allocation Problem: Its Solutions and Applications
- Linear max-min programming
- New algorithms for constrained minimax optimization
- Linearly constrained minimax optimization
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- On Marginal Allocation in Single Constraint Min-Max Problems
- More on Min-Max Allocation
This page was built for publication: Min-max optimization of several classical discrete optimization problems
