On the minimax path in a network

DOI10.1515/DMA.1994.4.5.447MaRDI QIDQ3835758zbMATH OpenOpenAlexFDO

Authors V. A. Trubin, Dmitrii Lozovanu

Publication date 22 May 1995

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1994.4.5.447

zbMATH Keywords

acyclic gamesminimax problemnetwork

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Multistage and repeated games (91A20)

Recommendations

• scientific article; zbMATH DE number 56364
• Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
• scientific article; zbMATH DE number 3916048
• Solving min-max shortest-path problems on a network

Cited in

(14)

• Network reduction for the acyclic constrained shortest path problem
• Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
• Efficient algorithms for some path partitioning problems
• Optimal paths in network games with \(p\) players
• Minimum-link paths revisited
• A constructive algorithm for max-min paths problems on energy networks
• scientific article; zbMATH DE number 3852815 (Why is no real title available?)
• Minimax trees, paths, and cut sets
• The structure of the optimal solution set on the shortest paths for networks
• scientific article; zbMATH DE number 3916048 (Why is no real title available?)
• scientific article; zbMATH DE number 4031432 (Why is no real title available?)
• scientific article; zbMATH DE number 56364 (Why is no real title available?)
• Solving min-max shortest-path problems on a network
• Global optimization: On pathlengths in min-max graphs

This page was built for publication: On the minimax path in a network

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