A minimax assignment problem in treelike communication networks

DOI10.1016/0377-2217(95)00238-3zbMath0915.90103OpenAlexW2064330444MaRDI QIDQ1390338

Gerhard J. Woeginger, Eranda Çela, Rainer E. Burkard

Publication date: 5 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00238-3

zbMATH Keywords

location problembranch-and-boundminimax assignmentundirected networkcommunication centres

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (2)

Random assignment problems ⋮ Selected topics on assignment problems

Cites Work

• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Greedy randomized adaptive search procedures
• Location of Transfer Centres on Segments of a Communication Network with Proportional Traffic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A minimax assignment problem in treelike communication networks