On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
scientific article

    Statements

    On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references