Pages that link to "Item:Q1426725"

The following pages link to A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725):

Displaying 39 items.

• The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← 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)
• A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974) (← links)
• Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (Q707776) (← links)
• Reduction approaches for robust shortest path problems (Q716356) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• The solution and duality of imprecise network problems (Q945182) (← links)
• A new model for path planning with interval data (Q1000974) (← 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)
• 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)
• A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• Distributionally robust maximum probability shortest path problem (Q2075464) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Shortest path network problems with stochastic arc weights (Q2230798) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• Ranking function-based solutions of fully fuzzified minimal cost flow problem (Q2385683) (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
• Time dependent vehicle routing problem with a multi ant colony system (Q2464200) (← links)
• Combinatorial algorithms for the minimum interval cost flow problem (Q2493698) (← 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)
• Routing Optimization Under Uncertainty (Q2806069) (← 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)
• Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
• The most likely path on series-parallel networks (Q3113510) (← links)
• An enhanced exact procedure for the absolute robust shortest path problem (Q3563623) (← links)
• Linear programming with interval right hand sides (Q3566454) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)