A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469): Difference between revisions

Revision as of 11:14, 19 August 2024

scientific article; zbMATH DE number 7767490

Language	Label	Description	Also known as
English	A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem	scientific article; zbMATH DE number 7767490

Statements

instance of

scholarly article

0 references

title

A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (English)

0 references

author

Ruslán G. Marzo

0 references

Celso Carneiro Ribeiro

0 references

published in

International Transactions in Operational Research

0 references

publication date

17 November 2023

0 references

zbMATH Keywords

prize-collecting generalized minimum spanning tree problem

0 references

generalized minimum spanning tree problem

0 references

GRASP

0 references

metaheuristics

0 references

randomized metaheuristics

0 references

path-relinking

0 references

restarts

0 references

time-to-target plots

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1111/itor.12725

0 references

cites work

A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

0 references

Steiner’s problem for set-terminals

0 references

Q3651735

0 references

Generalized spanning trees

0 references

Solving group Steiner problems as Steiner problems.

0 references

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs

0 references

A comparative analysis of several formulations for the generalized minimum spanning tree problem

0 references

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

0 references

An annotated bibliography of GRASP – Part I: Algorithms

0 references

An annotated bibliography of GRASP-Part II: Applications

0 references

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

0 references

Heuristic Search for the Generalized Minimum Spanning Tree Problem

0 references

The prize-collecting generalized minimum spanning tree problem

0 references

Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm

0 references

A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem

0 references

On the shortest spanning subtree of a graph and the traveling salesman problem

0 references

On the generalized minimum spanning tree problem

0 references

A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering

0 references

New models of the generalized minimum spanning tree problem

0 references

On the prize-collecting generalized minimum spanning tree problem

0 references

A two-level solution approach for solving the generalized minimum spanning tree problem

0 references

Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

Restart strategies for GRASP with path-relinking heuristics

0 references

Optimization by GRASP

0 references

A heuristic for the minimum cost chromatic partition problem

0 references

Hybridization of GRASP metaheuristic with data mining techniques

0 references

Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem

0 references

Identifiers

DOI

10.1111/itor.12725

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6090469

@@ Property / cites work @@
+A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
+Normal rank
@@ Property / cites work @@
+Steiner’s problem for set-terminals
@@ Property / cites work: Steiner’s problem for set-terminals / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized spanning trees
@@ Property / cites work: Generalized spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Solving group Steiner problems as Steiner problems.
+Normal rank
@@ Property / cites work @@
+The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A comparative analysis of several formulations for the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+An annotated bibliography of GRASP – Part I: Algorithms
+Normal rank
@@ Property / cites work @@
+An annotated bibliography of GRASP-Part II: Applications
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Heuristic Search for the Generalized Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
+Normal rank
@@ Property / cites work @@
+A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On the generalized minimum spanning tree problem
@@ Property / cites work: On the generalized minimum spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
+Normal rank
@@ Property / cites work @@
+New models of the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+On the prize-collecting generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A two-level solution approach for solving the generalized minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Restart strategies for GRASP with path-relinking heuristics
+Normal rank
@@ Property / cites work @@
+Optimization by GRASP
@@ Property / cites work: Optimization by GRASP / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for the minimum cost chromatic partition problem
+Normal rank
@@ Property / cites work @@
+Hybridization of GRASP metaheuristic with data mining techniques
+Normal rank
@@ Property / cites work @@
+Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
+Normal rank