Pages that link to "Item:Q1045926"
From MaRDI portal
The following pages link to An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926):
Displaying 19 items.
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- \(k\)-regret minimizing set: efficient algorithms and hardness (Q3174902) (← links)
- Learning Control Sets for Lattice Planners from User Preferences (Q3381986) (← links)
- Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- Efficient Algorithms for k-Regret Minimizing Sets (Q4580150) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
- On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- On the enumeration of non-dominated matroids with imprecise weights (Q6638831) (← links)