The robust spanning tree problem with interval data
From MaRDI portal
Publication:5949905
DOI10.1016/S0167-6377(01)00078-5zbMath0981.05029OpenAlexW2142818506WikidataQ126340812 ScholiaQ126340812MaRDI QIDQ5949905
Oya Ekin Karaşan, Mustafa Çelebi Pinar, Hande Yaman
Publication date: 5 December 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00078-5
Related Items
Robust inference of trees ⋮ The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ An exact algorithm for the robust shortest path problem with interval data ⋮ Approximate robust optimization for the connected facility location problem ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ A decision-theoretic approach to robust optimization in multivalued graphs ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem ⋮ Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty ⋮ On combinatorial optimization problems on matroids with uncertain weights ⋮ The robust minimum spanning tree problem: compact and convex uncertainty ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ The computational complexity of the relative robust shortest path problem with interval data ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ A branch and bound algorithm for the minimax regret spanning arborescence ⋮ Restricted robust uniform matroid maximization under interval uncertainty ⋮ Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Optimization problems with evidential linear objective ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Pinpointing the complexity of the interval min-max regret knapsack problem ⋮ Robust optimization of graph partitioning involving interval uncertainty ⋮ Minmax regret linear resource allocation problems. ⋮ The balanced minimum evolution problem under uncertain data ⋮ A branch and bound algorithm for the robust shortest path problem with interval data. ⋮ Complexity of the min-max (regret) versions of min cut problems ⋮ On the complexity of the robust spanning tree problem with interval data ⋮ On a Class of Interval Data Minmax Regret CO Problems ⋮ On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Simulated annealing algorithm for the robust spanning tree problem ⋮ Formulation and algorithms for the robust maximal covering location problem ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Combinatorial two-stage minmax regret problems under interval uncertainty ⋮ Linear programming with interval right hand sides ⋮ Compromise solutions for robust combinatorial optimization with variable-sized uncertainty ⋮ A unified approach to uncertain optimization ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ A branch and bound algorithm for the robust spanning tree problem with interval data ⋮ Heuristics for the central tree problem ⋮ A relaxation algorithm with a probabilistic guarantee for robust deviation optimization ⋮ Robust optimization of contaminant sensor placement for community water systems ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ Strong formulations of robust mixed 0-1 programming ⋮ Persistence in discrete optimization under data uncertainty ⋮ A Benders decomposition approach for the robust spanning tree problem with interval data ⋮ Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality ⋮ Some tractable instances of interval data minmax regret problems ⋮ Query minimization under stochastic uncertainty ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ⋮ A polynomial solvable minimum risk spanning tree problem with interval data ⋮ Combinatorial optimization in system configuration design ⋮ The minimum spanning tree problem with fuzzy costs ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs ⋮ Interval data minmax regret network optimization problems ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ Some methods for evaluating the optimality of elements in matroids with ill-known weights ⋮ Interval-parameter optimization problems on graphs ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ An approximation algorithm for interval data minmax regret combinatorial optimization problems ⋮ Robust discrete spanning tree problem: local search algorithms ⋮ Complexity of the min-max and min-max regret assignment problems ⋮ On the hardness of evaluating criticality of activities in a planar network with duration intervals ⋮ Robust optimization for the hazardous materials transportation network design problem
Cites Work
This page was built for publication: The robust spanning tree problem with interval data
