scientific article; zbMATH DE number 3648122

zbMATH Open0416.68041MaRDI QIDQ3206316FDOQ3206316

Authors: Antoon W. J. Kolen 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexitylocation problems in networksNp- completenessNp-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Operations research and management science (90B99)

Cited In (2)

• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
• A double annealing algorithm for discrete location/allocation problems

This page was built for publication:

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