Pages that link to "Item:Q1433657"

The following pages link to On the complexity of the robust spanning tree problem with interval data (Q1433657):

Displaying 26 items.

• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• The update complexity of selection and related problems (Q315536) (← links)
• On exact solutions for the minmax regret spanning tree problem (Q337033) (← 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)
• 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)
• Heuristics for the central tree problem (Q707727) (← links)
• A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
• Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
• Robust inference of trees (Q819944) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
• Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
• Some tractable instances of interval data minmax regret problems (Q1003488) (← 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)
• The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← 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)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
• Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)