Pages that link to "Item:Q1075944"
From MaRDI portal
The following pages link to Minimax linear programming problem (Q1075944):
Displaying 20 items.
- A computational study of minimax flow centers in trees (Q583225) (← links)
- Minmax linear programmes with grouped variables (Q1122476) (← links)
- Multiperiod allocation of substitutable resources (Q1127148) (← links)
- Solving linear programming problems via linear minimax problems (Q1180710) (← links)
- Reshipments and overshipments in transportation problems with minimax objective (Q1182137) (← links)
- Minimax resource allocation problems: Optimization and parametric analysis (Q1198300) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Dynamic min-max problems (Q1300102) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Maxmin subject to marginal constraints (Q1905227) (← links)
- On the co-NP-completeness of the zonotope containment problem (Q2068561) (← links)
- A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
- A mofified gub algorithm for solving linear minimax problems (Q4729610) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
