Min-max optimization of several classical discrete optimization problems
From MaRDI portal
Recommendations
Cites work
- A graphical method to solve a maximin allocation problem
- A Max-Min Allocation Problem: Its Solutions and Applications
- A min-max resource allocation problem with substitutions
- A nonlinear minimax allocation problem with multiple knapsack constraints
- A shifting algorithm for constrained min-max partition on trees
- An algorithm for separable nonlinear minimax problems
- An algorithm for solving linearly constrained minimax problems
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Complexity results for a class of min-max problems with robust optimization applications
- Continuous maximin knapsack problems with GLB constraints
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- Linear max-min programming
- Linearly constrained minimax optimization
- Minimax linear programming problem
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
- More on Min-Max Allocation
- New algorithms for constrained minimax optimization
- On Marginal Allocation in Single Constraint Min-Max Problems
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Resource allocation among competing activities: A lexicographic minimax approach
- Technical Note—On Min-Max Integer Allocation Problems
- Trajectory-following algorithms for min-max optimization problems
Cited in
(20)- Reference variable methods of solving min-Max optimization problems
- Ordered weighted average optimization in multiobjective spanning tree problem
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- A minmax regret linear regression model under uncertainty in the dependent variable
- On the resolution of certain discrete univariate max-min problems
- Linear optimization with bipolar max-min constraints
- Approximating max-min weighted \(T\)-joins
- 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
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- Minimising maximum response time
- scientific article; zbMATH DE number 175722 (Why is no real title available?)
- Global minimax approaches for solving discrete problems
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- scientific article; zbMATH DE number 895365 (Why is no real title available?)
- scientific article; zbMATH DE number 1407504 (Why is no real title available?)
- Dynamic linear programming games with risk-averse players
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- Algebraic-based primal interior-point algorithms for stochastic infinity norm optimization
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
This page was built for publication: Min-max optimization of several classical discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265052)
