Pages that link to "Item:Q596264"

The following pages link to The computational complexity of the relative robust shortest path problem with interval data (Q596264):

Displaying 33 items.

• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← 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)
• An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
• Deterministic risk control for cost-effective network connections (Q621844) (← links)
• Reduction approaches for robust shortest path problems (Q716356) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← 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)
• A new model for path planning with interval data (Q1000974) (← links)
• A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← 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)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• The robust shortest path problem in series -- parallel multidigraphs with interval data (Q2583712) (← links)
• An approach to the distributionally robust shortest path problem (Q2668652) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• Robust Optimization for the Hazardous Materials Transportation Network Design Problem (Q2867136) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• The most likely path on series-parallel networks (Q3113510) (← links)
• Optimization under Decision-Dependent Uncertainty (Q4571878) (← links)
• On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)