The bandpass problem: Combinatorial optimization and library of problems

DOI10.1007/s10878-008-9143-3zbMath1173.90504OpenAlexW2054583566MaRDI QIDQ1037450

Urfat G. Nuriyev, Djangir A. Babayev, George I. Bell

Publication date: 16 November 2009

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

Full work available at URL: https://doi.org/10.1007/s10878-008-9143-3

zbMATH Keywords

NP-hard problemcombinatorial optimization problemandpass problembinary integer programming modelheuristic polynomial algorithmslibrary of problems

Mathematics Subject Classification ID

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

Related Items

The three column bandpass problem is solvable in linear time, 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 band collocation problem

Uses Software

• NEOS

Cites Work

• On the Homotopy Type of Stiefel Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item