A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2016.12.010
@@ Property / DOI: 10.1016/j.cor.2016.12.010 / rank @@
-Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Stochastic Search and Optimization
+Normal rank
@@ Property / cites work @@
+Computing and minimizing the relative regret in combinatorial optimization with interval data
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Exact and heuristic algorithms for the interval data robust assignment problem
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+Normal rank
@@ Property / cites work @@
+Discrete optimization with interval data. Minmax regret and fuzzy approach
+Normal rank
@@ Property / cites work @@
+Pinpointing the complexity of the interval min-max regret knapsack problem
+Normal rank
@@ Property / cites work @@
+The robust set covering problem with interval data
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Restricted robust uniform matroid maximization under interval uncertainty
+Normal rank
@@ Property / cites work @@
+Logic-based Benders decomposition
@@ Property / cites work: Logic-based Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
+Normal rank
@@ Property / cites work @@
+Approximation of min-max and min-max regret versions of some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
+Normal rank
@@ Property / cites work @@
+The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
+Normal rank
@@ Property / cites work @@
+On a constant factor approximation for minmax regret problems using a symmetry point scenario
+Normal rank
@@ Property / cites work @@
+A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
+Normal rank
@@ Property / cites work @@
+On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
+Normal rank
@@ Property / cites work @@
+Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
+Normal rank
@@ Property / cites work @@
+A note on the selection of Benders' cuts
@@ Property / cites work: A note on the selection of Benders' cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
+Normal rank
@@ Property / cites work @@
+Shortest chain subject to side constraints
@@ Property / cites work: Shortest chain subject to side constraints / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+The shortest route problem with constraints
@@ Property / cites work: The shortest route problem with constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
+Normal rank
@@ Property / cites work @@
+A survey of resource constrained shortest path problems: Exact solution approaches
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Reduction approaches for robust shortest path problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+Normal rank
@@ Property / cites work @@
+Algorithms for railway crew management
@@ Property / cites work: Algorithms for railway crew management / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398380
@@ Property / cites work: Q4398380 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the set covering problem
@@ Property / cites work: Algorithms for the set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2016.12.010
@@ Property / DOI: 10.1016/J.COR.2016.12.010 / rank @@
+Normal rank