Pages that link to "Item:Q1591541"

The following pages link to Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541):

Displaying 34 items.

• Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
• Min-max regret robust optimization approach on interval data uncertainty (Q946180) (← links)
• Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• Minimizing total weighted flow time under uncertainty using dominance and a stability box (Q1762112) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← links)
• Interval data minmax regret network optimization problems (Q1827805) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• Minimizing maximum cost for a single machine under uncertainty of processing times (Q2184134) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Robust supply chain network design with multi-products for a company in the food sector (Q2295953) (← links)
• An uncertainty management framework for industrial applications (Q2358143) (← links)
• Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
• Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
• Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization (Q2462558) (← links)
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241) (← links)
• The minmax regret permutation flow-shop problem with two jobs (Q2572850) (← links)
• The two-echelon island fuel distribution problem (Q2672122) (← links)
• Relative Robust and Adaptive Optimization (Q3386774) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations (Q6160435) (← links)