Pages that link to "Item:Q706974"
From MaRDI portal
The following pages link to A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974):
Displayed 25 items.
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513) (← 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 integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← links)
- Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← 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)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- An approximation algorithm for interval data minmax regret combinatorial optimization problems (Q1045926) (← links)
- Interval data minmax regret network optimization problems (Q1827805) (← links)
- Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
- A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
- Optimality conditions for interval valued optimization problems (Q6061515) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)