Heuristics for the connected assignment problem in arrays

DOI10.1111/itor.12706OpenAlexW2967575502MaRDI QIDQ6092548

Manoel B. Campêlo, Joel C. Soares, Unnamed Author, Unnamed Author

Publication date: 23 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.12706

zbMATH Keywords

integer programmingheuristicradio resource allocationconnected assignment

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
• Efficient approximation of convex recolorings
• Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fundamentals of Wireless Communication
• Convex Recoloring Revisited: Complexity and Exact Algorithms

This page was built for publication: Heuristics for the connected assignment problem in arrays