Pages that link to "Item:Q2507502"

The following pages link to The robust shortest path problem with interval data via Benders decomposition (Q2507502):

Displaying 35 items.

• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← 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)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← 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)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Constrained optimization problems under uncertainty with coherent lower previsions (Q690890) (← links)
• Reduction approaches for robust shortest path problems (Q716356) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (Q1751178) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
• The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← 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)
• Robust Optimization for the Hazardous Materials Transportation Network Design Problem (Q2867136) (← links)
• Recoverable robust shortest path problems (Q2892155) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
• An enhanced exact procedure for the absolute robust shortest path problem (Q3563623) (← links)
• Linear programming with interval right hand sides (Q3566454) (← links)
• Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
• Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network (Q5191132) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)