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 50 items.
- The update complexity of selection and related problems (Q315536) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795) (← links)
- Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- Distributionally robust single machine scheduling with risk aversion (Q1752194) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
- Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
- 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)
- 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)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
