How difficult is the frequency selection problem?

DOI10.1016/0167-6377(95)00004-4zbMath0843.90132OpenAlexW1966457248MaRDI QIDQ1905076

Jacobson, Sheldon H.

Publication date: 16 January 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00004-4

zbMATH Keywords

simulationNP-complete problemdiscrete-event simulationsfrequency domain methodologyfrequency selection problemindicator function spacing problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Design of frequency-domain experiments for discrete-valued factors
• How easy is local search?
• Hill Climbing with Multiple Local Optima
• Driving Frequency Selection for Frequency Domain Simulation Experiments
• Simulation Factor Screening Using Harmonic Analysis

This page was built for publication: How difficult is the frequency selection problem?