Heuristics for the connected assignment problem in arrays

DOI10.1111/ITOR.12706MaRDI QIDQ6092548zbMATH OpenOpenAlexFDO

Authors Manoel Campêlo, Joel C. Soares

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

connected assignmentheuristicinteger programmingradio resource allocation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
• Convex Recoloring Revisited: Complexity and Exact Algorithms
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• Efficient approximation of convex recolorings
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fundamentals of Wireless Communication
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092548)