Pages that link to "Item:Q5949905"

The following pages link to The robust spanning tree problem with interval data (Q5949905):

Displaying 22 items.

• Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
• Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
• Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
• A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
• The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) (← links)
• Robust optimization of contaminant sensor placement for community water systems (Q2492697) (← links)
• Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
• Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• The robust minimum spanning tree problem: compact and convex uncertainty (Q2643812) (← links)
• On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
• Linear programming with interval right hand sides (Q3566454) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• Uncertainty Preferences in Robust Mixed-Integer Linear Optimization with Endogenous Uncertainty (Q5067432) (← links)
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242) (← links)
• On a Class of Interval Data Minmax Regret CO Problems (Q5391890) (← links)
• Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality (Q5448654) (← links)
• Query minimization under stochastic uncertainty (Q5925528) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
• Optimization problems with evidential linear objective (Q6178726) (← links)