A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879): Difference between revisions

Latest revision as of 02:14, 3 August 2024

scientific article; zbMATH DE number 7744682

Language	Label	Description	Also known as
English	A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty	scientific article; zbMATH DE number 7744682

Statements

instance of

scholarly article

0 references

title

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (English)

0 references

0 references

0 references

0 references

0 references

Vinícius Fernandes dos Santos

0 references

published in

International Transactions in Operational Research

0 references

publication date

29 September 2023

0 references

zbMATH Keywords

minmax regret

0 references

interval uncertainty

0 references

single-source shortest path

0 references

metaheuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs

0 references

Interval data minmax regret network optimization problems

0 references

Robust solutions of linear programming problems contaminated with uncertain data

0 references

Robust discrete optimization and network flows

0 references

The Price of Robustness

0 references

On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions

0 references

A MILP-based VND for the min-max regret shortest path tree problem with interval costs

0 references

Reduction approaches for robust shortest path problems

0 references

Unit disk graphs

0 references

An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem

0 references

A branch and bound algorithm for the minimax regret spanning arborescence

0 references

Minimax regret spanning arborescences under uncertain costs

0 references

Q3651735

0 references

Exploring relaxation induced neighborhoods to improve MIP solutions

0 references

Q3093335

0 references

A note on two problems in connexion with graphs

0 references

A fix-and-optimize heuristic for the high school timetabling problem

0 references

A Multiple Comparison Procedure for Comparing Several Treatments with a Control

0 references

Q4198056

0 references

Random Graphs

0 references

Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice

0 references

The fleet size and mix vehicle routing problem

0 references

An approximation algorithm for interval data minmax regret combinatorial optimization problems

0 references

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

0 references

Robust discrete optimization and its applications

0 references

Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions

0 references

Improved flow-based formulations for the skiving stock problem

0 references

Variable neighborhood search

0 references

A Benders decomposition approach for the robust spanning tree problem with interval data

0 references

An exact algorithm for the robust shortest path problem with interval data

0 references

A branch and bound algorithm for the robust spanning tree problem with interval data

0 references

The robust shortest path problem with interval data via Benders decomposition

0 references

A branch and bound algorithm for the robust shortest path problem with interval data.

0 references

Simulated annealing algorithm for the robust spanning tree problem

0 references

On exact solutions for the minmax regret spanning tree problem

0 references

Algorithms for the minmax regret path problem with interval data

0 references

The robust minimum spanning tree problem: compact and convex uncertainty

0 references

An analysis of variance test for normality (complete samples)

0 references

Integer programming formulations for the elementary shortest path problem

0 references

Mixed integer programming based heuristics for the patient admission scheduling problem

0 references

The robust spanning tree problem with interval data

0 references

Identifiers

DOI

10.1111/itor.12947

0 references

Mathematics Subject Classification ID

90-XX

0 references

zbMATH DE Number

7744682

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6079879

@@ Property / cites work @@
+A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+Robust solutions of linear programming problems contaminated with uncertain data
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
+Normal rank
@@ Property / cites work @@
+A MILP-based VND for the min-max regret shortest path tree problem with interval costs
+Normal rank
@@ Property / cites work @@
+Reduction approaches for robust shortest path problems
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / 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 @@
+A branch and bound algorithm for the minimax regret spanning arborescence
+Normal rank
@@ Property / cites work @@
+Minimax regret spanning arborescences under uncertain costs
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring relaxation induced neighborhoods to improve MIP solutions
+Normal rank
@@ Property / cites work @@
+Q3093335
@@ Property / cites work: Q3093335 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A fix-and-optimize heuristic for the high school timetabling problem
+Normal rank
@@ Property / cites work @@
+A Multiple Comparison Procedure for Comparing Several Treatments with a Control
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Random Graphs
@@ Property / cites work: Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
+Normal rank
@@ Property / cites work @@
+The fleet size and mix vehicle routing problem
@@ Property / cites work: The fleet size and mix vehicle routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+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 @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
+Normal rank
@@ Property / cites work @@
+Improved flow-based formulations for the skiving stock problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for 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 @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+Normal rank
@@ Property / cites work @@
+Simulated annealing algorithm for the robust spanning tree problem
+Normal rank
@@ Property / cites work @@
+On exact solutions for the minmax regret spanning tree problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the minmax regret path problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust minimum spanning tree problem: compact and convex uncertainty
+Normal rank
@@ Property / cites work @@
+An analysis of variance test for normality (complete samples)
+Normal rank
@@ Property / cites work @@
+Integer programming formulations for the elementary shortest path problem
+Normal rank
@@ Property / cites work @@
+Mixed integer programming based heuristics for the patient admission scheduling problem
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6079879