Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems - MaRDI portal

The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems

From MaRDI portal

Publication:5422494

Jump to:navigation, search

DOI10.1137/S0097539701391518zbMath1161.90468OpenAlexW2035337703WikidataQ57401496 ScholiaQ57401496MaRDI QIDQ5422494

Gregory B. Sorkin, Alan M. Frieze

Publication date: 22 October 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539701391518

zbMATH Keywords

matching Assignment problem asymmetric traveling salesman problem permutation digraph cycle cover alternating path average-case analysis of algorithms random assignment problem near-permutation digraph patching heuristic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Combinatorial optimization (90C27) Combinatorial probability (60C05)

Related Items (4)

The cost of strategy-proofness in school choice ⋮ Random assignment problems ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights

This page was built for publication: The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5422494&oldid=20167291"