The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows

DOI10.1287/ijoc.2013.0568zbMath1356.90071OpenAlexW2095153636MaRDI QIDQ2962560

Mohammad Javad Feizollahi, Igor Averbakh

Publication date: 17 February 2017

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

Full work available at URL: https://doi.org/10.1287/ijoc.2013.0568

zbMATH Keywords

tabu searchquadratic assignment problemminmax regretrobust optimizationbenders decomposition

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Quadratic programming (90C20) Discrete location and assignment (90B80)

Related Items (5)

Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ A robust stochastic casualty collection points location problem

Cites Work

• The robust set covering problem with interval data
• Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
• On a constant factor approximation for minmax regret problems using a symmetry point scenario
• The computational complexity of the relative robust shortest path problem with interval data
• On the approximability of robust spanning tree problems
• Exact and heuristic algorithms for the interval data robust assignment problem
• Complexity of the min-max and min-max regret assignment problems
• Restricted robust uniform matroid maximization under interval uncertainty
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• On the approximability of minmax (regret) network optimization problems
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Partitioning procedures for solving mixed-variables programming problems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• A branch and bound algorithm for the robust shortest path problem with interval data.
• Interval data minmax regret network optimization problems
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• The Quadratic Assignment Problem
• Accelerating Benders Decomposition by Local Branching
• Assignment Problems and the Location of Economic Activities
• A new linearization method for quadratic assignment problems
• Tabu Search—Part I
• Tabu Search—Part II
• P-Complete Approximation Problems
• On the complexity of a class of combinatorial optimization problems with uncertainty
• The robust spanning tree problem with interval data

This page was built for publication: The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows