Pages that link to "Item:Q1827805"

The following pages link to Interval data minmax regret network optimization problems (Q1827805):

Displaying 50 items.

• Random walks on graphs with interval weights and precise marginals (Q274449) (← links)
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← 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)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness (Q475802) (← links)
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
• Deterministic risk control for cost-effective network connections (Q621844) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Heuristics for the central tree problem (Q707727) (← links)
• Reduction approaches for robust shortest path problems (Q716356) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
• Robust approach to restricted items selection problem (Q828685) (← links)
• On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
• A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← 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)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) (← 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)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← 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)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← 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)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• Robust optimization analysis for multiple attribute decision making problems with imprecise information (Q1761928) (← links)
• Computing \(k\)-centers of uncertain points on a real line (Q2157899) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)