The robust spanning tree problem with interval data
From MaRDI portal
Recommendations
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust fractional spanning tree problem with interval data
- A polynomial solvable minimum risk spanning tree problem with interval data
- On the approximability of robust spanning tree problems
Cites work
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 804636 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- Robust Optimization of Large-Scale Systems
- Robust discrete optimization and its applications
- Robust solutions of uncertain linear programs
Cited in
(85)- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- The robust minimum spanning tree problem: compact and convex uncertainty
- The Minimum Risk Spanning Tree Problem
- Choosing robust solutions in discrete optimization problems with fuzzy costs
- A polynomial solvable minimum risk spanning tree problem with interval data
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Heuristics for the central tree problem
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Approximating optimization problems in graphs with locational uncertainty
- Approximate robust optimization for the connected facility location problem
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Simulated annealing algorithm for the robust spanning tree problem
- A unified approach to uncertain optimization
- Strong formulations of robust mixed 0-1 programming
- Robust inference of trees
- The balanced minimum evolution problem under uncertain data
- On the enumeration of non-dominated spanning trees with imprecise weights
- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- The minimum spanning tree problem with fuzzy costs
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Formulation and algorithms for the robust maximal covering location problem
- Restricted robust uniform matroid maximization under interval uncertainty
- Algorithm robust for the bicriteria discrete optimization problem
- On the hardness of evaluating criticality of activities in a planar network with duration intervals
- On the approximability of robust spanning tree problems
- On combinatorial optimization problems on matroids with uncertain weights
- Crystal trees
- Connection situations under uncertainty and cost monotonic solutions
- A capacitated hub location problem under hose demand uncertainty
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Robust optimization for the hazardous materials transportation network design problem
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Interval data minmax regret network optimization problems
- Some tractable instances of interval data minmax regret problems
- Robustness in operational research and decision aiding: a multi-faceted issue
- Target-based distributionally robust minimum spanning tree problem
- Minimax regret spanning arborescences under uncertain costs
- On a Class of Interval Data Minmax Regret CO Problems
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Robust optimization of graph partitioning involving interval uncertainty
- Optimization problems with evidential linear objective
- Robust Algorithms for TSP and Steiner Tree
- Robust algorithms for TSP and Steiner tree
- An exact algorithm for the robust shortest path problem with interval data
- Complexity of the min-max and min-max regret assignment problems
- Combinatorial optimization in system configuration design
- On the complexity of the robust spanning tree problem with interval data
- On exact solutions for the minmax regret spanning tree problem
- Minmax regret linear resource allocation problems.
- Interval elimination method for stochastic spanning tree problem
- Complexity of the min-max (regret) versions of min cut problems
- The robust fractional spanning tree problem with interval data
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- A decision-theoretic approach to robust optimization in multivalued graphs
- Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Query minimization under stochastic uncertainty
- Some methods for evaluating the optimality of elements in matroids with ill-known weights
- New models for the robust shortest path problem: complexity, resolution and generalization
- A branch and bound algorithm for the robust spanning tree problem with interval data
- On the enumeration of non-dominated matroids with imprecise weights
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- Interval-parameter optimization problems on graphs
- On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
- A branch and bound algorithm for the minimax regret spanning arborescence
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Robust optimization of contaminant sensor placement for community water systems
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Greediness is not always a vice: efficient discovery algorithms for assignment problems
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Persistence in discrete optimization under data uncertainty
- Optimal path discovery problem with homogeneous knowledge
- Linear programming with interval right hand sides
- Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty
- The computational complexity of the relative robust shortest path problem with interval data
- Robust discrete spanning tree problem: local search algorithms
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Combinatorial two-stage minmax regret problems under interval uncertainty
This page was built for publication: The robust spanning tree problem with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949905)
