Pages that link to "Item:Q1265052"
From MaRDI portal
The following pages link to Min-max optimization of several classical discrete optimization problems (Q1265052):
Displaying 12 items.
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Minimising maximum response time (Q336510) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Reference variable methods of solving min-Max optimization problems (Q1024824) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
- Linear optimization with bipolar max-min constraints (Q2446384) (← links)
- Approximating max-min weighted \(T\)-joins (Q2450657) (← links)
- Robust production and transportation planning in thin film transistor-liquid crystal display (TFT-LCD) industry under demand and price uncertainties (Q3163152) (← links)
