An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion

DOI10.1287/ijoc.2022.1189OpenAlexW3112162944MaRDI QIDQ5057998

Manuel Iori, Wei Wu, Silvano Martello, Mutsunori Yagiura

Publication date: 1 December 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

heuristicscombinatorial optimizationmin-max regretiterated dual substitution

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• OR-Library
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• GitHub
• The robust set covering problem with interval data
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• Pinpointing the complexity of the interval min-max regret knapsack problem
• Exact and heuristic algorithms for the interval data robust assignment problem
• A branch and bound algorithm for the robust spanning tree problem with interval data
• There is no EPTAS for two-dimensional knapsack
• Complexity of the min-max and min-max regret assignment problems
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• A genetic algorithm for the multidimensional knapsack problem
• A genetic algorithm for the generalised assignment problem
• Tabu search for the multilevel generalized assignment problem
• The robust (minmax regret) assembly line worker assignment and balancing problem
• Robust multiobjective portfolio optimization: A minimax regret approach
• Minimax regret strategies for greenhouse gas abatement: Methodology and application
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
• Minmax regret combinatorial optimization problems: an Algorithmic Perspective
• Reducibility among Combinatorial Problems
• The robust spanning tree problem with interval data

This page was built for publication: An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion