scientific article; zbMATH DE number 558538

zbMATH Open0798.90051MaRDI QIDQ4289892FDOQ4289892

Authors: John Karkazis 

Publication date: 28 April 1994

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

Recommendations

• A minimax assignment problem in treelike communication networks
• The minimum range assignment problem on linear radio networks
• Maximin problem of communication network synthesis
• Optimal task assignment in linear array networks
• The constrained minimax linear assignment problem
• scientific article; zbMATH DE number 2239572
• scientific article; zbMATH DE number 1670654
• scientific article; zbMATH DE number 1204363
• Minimax problem of suppressing a communication network
• scientific article; zbMATH DE number 4149863

zbMATH Keywords

branch-and-boundminimax assignmentlinear networkcommunication centres

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Cited In (7)

• Minimax problem of suppressing a communication network
• Solutions to a class of minimax decision problems arising in communication systems
• Title not available (Why is that?)
• On the finite transmission zero assignment problem
• A minimax assignment problem in treelike communication networks
• Title not available (Why is that?)
• The optimal arrangement of communication centres linked by a trunk

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 Q4289892)