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

DOI10.1007/978-3-319-45587-7_1zbMath1419.90090arXiv2001.00943OpenAlexW2514449360MaRDI QIDQ2835657

Andréa Cynthia Santos, Rafael Andrade, Thiago F. Noronha, Lucas Assunção

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00943

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty, Logic-Based Benders Decomposition for Large-Scale Optimization, Formulation and algorithms for the robust maximal covering location problem

Cites Work

• Unnamed Item
• The robust set covering problem with interval data
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• Exact and heuristic algorithms for the interval data robust assignment problem
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• 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
• Partitioning procedures for solving mixed-variables programming problems
• Robust discrete optimization and its applications
• Logic-based Benders decomposition
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• Generalized Benders decomposition
• A note on the selection of Benders' cuts
• Combinatorial Benders' Cuts for the Strip Packing Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Introduction to Stochastic Search and Optimization
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data