Pages that link to "Item:Q1885969"

The following pages link to An exact algorithm for the robust shortest path problem with interval data (Q1885969):

Displaying 49 items.

• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
• Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness (Q475802) (← links)
• On robust online scheduling algorithms (Q539452) (← links)
• The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← links)
• Deterministic risk control for cost-effective network connections (Q621844) (← links)
• Reduction approaches for robust shortest path problems (Q716356) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← links)
• Minimum power multicasting problem in wireless networks (Q953297) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
• A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
• Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← 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)
• Ranking robustness and its application to evacuation planning (Q1681390) (← links)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
• A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
• Distributionally robust maximum probability shortest path problem (Q2075464) (← links)
• \( \alpha \)-reliable shortest path problem in uncertain time-dependent networks (Q2149400) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Measuring and mitigating the effects of cost disturbance propagation in multi-echelon apparel supply chains (Q2282499) (← links)
• Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
• Integer programming formulations for the shared multicast tree problem (Q2331596) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks (Q2427201) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• The robust shortest path problem with interval data via Benders decomposition (Q2507502) (← 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)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)
• Robust Optimization for the Hazardous Materials Transportation Network Design Problem (Q2867136) (← links)
• Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
• An enhanced exact procedure for the absolute robust shortest path problem (Q3563623) (← links)
• Linear programming with interval right hand sides (Q3566454) (← links)
• The Exact Subgraph Recoverable Robust Shortest Path Problem (Q3649167) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
• On modelling and solving the shortest path problem with evidential weights (Q6160930) (← links)
• Benchmarking problems for robust discrete optimization (Q6568403) (← links)