An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search

DOI10.1111/itor.12880OpenAlexW3090053899MaRDI QIDQ6070498

Carlos Contreras-Bolton, Víctor Parada

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12880

zbMATH Keywords

metaheuristicsiterated local searchprize-collecting generalized minimum spanning tree problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Continuous approximation formulas for location problems ⋮ Exact and heuristic solutions for the prize‐collecting geometric enclosure problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Class Steiner trees and VLSI-design
• Generalized spanning trees
• A two-level solution approach for solving the generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• The prize-collecting generalized minimum spanning tree problem
• On the prize-collecting generalized minimum spanning tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• ParamILS: An Automatic Algorithm Configuration Framework
• TSPLIB—A Traveling Salesman Problem Library
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• On the History of the Minimum Spanning Tree Problem
• On the generalized minimum spanning tree problem
• Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
• Branch‐and‐cut algorithms for the ‐arborescence star problem
• Solving the prize‐collecting Euclidean Steiner tree problem
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

This page was built for publication: An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search