Sensitivity Analysis of Network Optimization Problems
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The order of node removals in influence diagram”
Sensitivity Analysis of Network Optimization Problems
On the minimum dummy-arc problem
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Upward planarization layout.
Chimani, Markus, Gutwenger, Carsten, Mutzel, Petra, Wong, Hoi-Ming (2011)
Journal of Graph Algorithms and Applications
Similarity:
Finding the k Most Vital Elements of an s-t Planar Directed Network
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
On recursively directed hypercubes.
Domshlak, Carmel (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On an evaluation function for heuristic search as a path problem
Ľudovít Molnár (1971)
Kybernetika
Similarity:
-colour partitions of acyclic tournaments.
Barcia, Paulo, Cerdeira, J. Orestes (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: