Pages that link to "Item:Q924859"

The following pages link to Discrete optimization with interval data. Minmax regret and fuzzy approach (Q924859):

Displaying 44 items.

• The robust set covering problem with interval data (Q367647) (← links)
• Fast minimum float computation in activity networks under interval uncertainty (Q398844) (← links)
• Gradualness, uncertainty and bipolarity: making sense of fuzzy sets (Q419038) (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Discrete optimization problems with interval data: Pareto set of solutions or set of weak solutions? (Q701961) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• A note on robustness tolerances for combinatorial optimization problems (Q765526) (← links)
• Robust approach to restricted items selection problem (Q828685) (← links)
• Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
• Min-max regret robust optimization approach on interval data uncertainty (Q946180) (← links)
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
• A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← 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)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
• Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights (Q1706134) (← links)
• Robust multicovers with budgeted uncertainty (Q1755380) (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) (← links)
• Complexity of the robust weighted independent set problems on interval graphs (Q2018858) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• Learning \(k\)-maxitive fuzzy measures from data by mixed integer programming (Q2048756) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
• Robust strategic planning for mobile medical units with steerable and unsteerable demands (Q2239842) (← links)
• A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← 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)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← 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)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• Robust Optimization by Fuzzy Linear Programming (Q4558808) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
• Optimization problems with evidential linear objective (Q6178726) (← links)
• On the enumeration of non-dominated spanning trees with imprecise weights (Q6587937) (← links)
• On the enumeration of non-dominated matroids with imprecise weights (Q6638831) (← links)