Skip to main content
Log in

Minimizing the span of d-walks to compute optimum frequency assignments

  • Published:
Mathematical Programming Submit manuscript

Abstract.

In this paper we deal with the Minimum Span Frequency Assignment Problem (MSFAP), that is the problem of assigning a limited set of radio frequencies to the base stations of a radio network so as the bandwidth occupancy is minimized and the overall interference is not too large. We present a new integer linear formulation for MSFAP in the multidemand case, which is the basis of an exact algorithm to compute both lower and upper bounds for MSFAP. Frequency assignments are represented as walks (sequence of nodes) in a graph. We look for a walk of minimum span, where the span of a walk is defined as the cost of a maximum cost subwalk (subsequence). The new approach is able to find optimum solutions over a large set of classical benchmarks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 10, 2000 / Accepted: July 6, 2001¶Published online October 26, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Avenali, A., Mannino, C. & Sassano, A. Minimizing the span of d-walks to compute optimum frequency assignments. Math. Program. 91, 357–374 (2002). https://doi.org/10.1007/s101070100247

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100247

Navigation