Pages that link to "Item:Q2503220"

The following pages link to A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220):

Displaying 35 items.

• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• Robust storage loading problems with stacking and payload constraints (Q323109) (← links)
• On the recoverable robust traveling salesman problem (Q331985) (← 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)
• 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)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• Heuristics for the central tree problem (Q707727) (← links)
• Connection situations under uncertainty and cost monotonic solutions (Q716360) (← links)
• Robust inference of trees (Q819944) (← 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)
• Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• Uncertainty in cooperative interval games: how Hurwicz criterion compatibility leads to egalitarianism (Q2241247) (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
• Cooperative interval games: mountain situations with interval data (Q2349645) (← links)
• The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
• A reformulated Shapley-like value for cooperative games with interval payoffs (Q2661561) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
• Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← 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)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• Linear programming with interval right hand sides (Q3566454) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)