Network flow approaches for an asset-task assignment problem with execution uncertainty

DOI10.1007/978-90-481-9794-1_7MaRDI QIDQ4932642zbMATH OpenOpenAlexFDO

Authors Stelios Timotheou

Publication date 6 October 2010

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-90-481-9794-1_7

zbMATH Keywords

Random Neural Network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
• scientific article; zbMATH DE number 1084188
• Resource allocation on condition of random resource demand of network activities
• Multistate components assignment problem with optimal network reliability subject to assignment budget
• A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices

Cites work

• A target-assignment problem
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• Network flows. Theory, algorithms, and applications.

Cited in

(2)

• On the solution of a rational matrix equation arising in G-networks
• scientific article; zbMATH DE number 7625172 (Why is no real title available?)

This page was built for publication: Network flow approaches for an asset-task assignment problem with execution uncertainty

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