Pages that link to "Item:Q1014933"

The following pages link to Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933):

Displaying 50 items.

• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Competitive difference analysis of the cash management problem with uncertain demands (Q2294663) (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
• Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
• Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion (Q2450748) (← links)
• Bulk-robust combinatorial optimization (Q2515045) (← links)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
• On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)
• Multi-material topology optimization for maximizing structural stability under thermo-mechanical loading (Q2693419) (← links)
• On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
• Just-in-time scheduling under scenario-based uncertainty (Q2836525) (← links)
• ROPI—a robust optimization programming interface for C++ (Q2926082) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems (Q3055576) (← links)
• Robustness in Multi-criteria Decision Aiding (Q3058461) (← links)
• The lexicographic α-robust knapsack problem (Q3087844) (← links)
• An algebraic framework for multi-objective and robust variants of path problems (Q3297414) (← links)
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
• Clear Preferences Under Partial Distribution Information (Q4692027) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• (Q5109886) (← links)
• $$\beta $$ -Robustness Approach for Fuzzy Multi-objective Problems (Q5117211) (← links)
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization (Q5166306) (← links)
• Min‐Max quickest path problems (Q5326774) (← links)
• Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
• On the complexity of a class of combinatorial optimization problems with uncertainty (Q5935709) (← links)
• Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
• Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
• Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
• Data-driven robust optimization using deep neural networks (Q6109292) (← links)
• Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
• Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
• Global solution of constrained min-max problems with inflationary differential evolution (Q6159468) (← links)
• Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations (Q6160435) (← links)