Pages that link to "Item:Q337033"

The following pages link to On exact solutions for the minmax regret spanning tree problem (Q337033):

Displaying 7 items.

• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)