The band collocation problem

DOI10.1007/S10878-020-00576-2zbMath1447.90049OpenAlexW3034163016MaRDI QIDQ782758

Mehmet Kurt, Hakan Kutucu, Arif Gursoy, Urfat G. Nuriyev

Publication date: 29 July 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00576-2

zbMATH Keywords

heuristic algorithmcombinatorial optimization problemmeta-heuristic algorithmtelecommunicationbandpass problemdense wavelength-division multiplexing technology

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Uses Software

• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Approximating the maximum multiple RNA interaction problem
• A 0.5358-approximation for Bandpass-2
• Scatter search for the bandpass problem
• On the bandpass problem
• Mathematical models of the bandpass problem and OrderMatic computer game
• The three column bandpass problem is solvable in linear time
• The bandpass problem: Combinatorial optimization and library of problems
• Combinatorial optimization in communication networks.
• An Improved Approximation Algorithm for the Bandpass-2 Problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: The band collocation problem