Pages that link to "Item:Q5949905"
From MaRDI portal
The following pages link to The robust spanning tree problem with interval data (Q5949905):
Displaying 50 items.
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Approximate robust optimization for the connected facility location problem (Q299099) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← 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)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656) (← links)
- Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- The computational complexity of the relative robust shortest path problem with interval data (Q596264) (← 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)
- Connection situations under uncertainty and cost monotonic solutions (Q716360) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Robust inference of trees (Q819944) (← links)
- On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← 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)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Simulated annealing algorithm for the robust spanning tree problem (Q945053) (← 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)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- The minimum spanning tree problem with fuzzy costs (Q1028710) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- Some methods for evaluating the optimality of elements in matroids with ill-known weights (Q1037947) (← links)
- Interval-parameter optimization problems on graphs (Q1040365) (← 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)
- Minmax regret linear resource allocation problems. (Q1417598) (← links)
- A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
- On the complexity of the robust spanning tree problem with interval data (Q1433657) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem'' (Q1675565) (← links)
- Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- A unified approach to uncertain optimization (Q1753451) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Interval data minmax regret network optimization problems (Q1827805) (← links)
- On the hardness of evaluating criticality of activities in a planar network with duration intervals (Q1870004) (← links)
- An exact algorithm for the robust shortest path problem with interval data (Q1885969) (← links)
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties (Q1984604) (← links)
- Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
