The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
From MaRDI portal
Recommendations
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Robust min-max regret covering problems
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Minimax regret solution to linear programming problems with an interval objective function
- Exact and heuristic algorithms for the interval data robust assignment problem
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- scientific article; zbMATH DE number 714536
- scientific article; zbMATH DE number 721836
- Approximating the minimum quadratic assignment problems
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
Cites work
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A branch and bound algorithm for the robust shortest path problem with interval data.
- A new linearization method for quadratic assignment problems
- Accelerating Benders decomposition by local branching
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Assignment Problems and the Location of Economic Activities
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Exact and heuristic algorithms for the interval data robust assignment problem
- Interval data minmax regret network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- On the approximability of minmax (regret) network optimization problems
- On the approximability of robust spanning tree problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- P-Complete Approximation Problems
- Partitioning procedures for solving mixed-variables programming problems
- Restricted robust uniform matroid maximization under interval uncertainty
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers
- Tabu Search—Part I
- Tabu Search—Part II
- The computational complexity of the relative robust shortest path problem with interval data
- The quadratic assignment problem
- The robust set covering problem with interval data
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- The robust shortest path problem with interval data via Benders decomposition
- The robust spanning tree problem with interval data
Cited in
(7)- 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
- On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
- Facility layout problem with QAP formulation under scenario-based uncertainty
- Exact and heuristic algorithms for the interval data robust assignment problem
This page was built for publication: The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2962560)
