scientific article
From MaRDI portal
Publication:3318111
zbMATH Open0534.68033MaRDI QIDQ3318111
Publication date: 1982
Title of this publication is not available (Why is that?)
reliabilityenumerationprobabilistic analysisNP-completenesssimplex methodheuristic algorithmsnetwork problemsellipsoid methodNPPNP- hardness
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items (7)
The complexity of reconfiguring network models ⋮ The complexity of computations by networks ⋮ The congenial talking philosophers problem in computer networks ⋮ Computation of irregularity indices of certain computer networks ⋮ The computational complexity of the criticality problems in a network with interval activity times ⋮ Title not available (Why is that?) ⋮ Time and Energy Complexity of Function Computation Over Networks
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 Q3318111)
