Scaling and universality in continuous length combinatorial optimization
From MaRDI portal
Recommendations
- Phase Transitions in Combinatorial Optimization Problems
- Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model
- Cost distributions in large combinatorial optimisation problems
- scientific article; zbMATH DE number 4133843
- Scaling features in complex optimization problems
Cites work
Cited in
(11)- The planted matching problem: phase transitions and exact results
- Many hard examples in exact phase transitions
- Edge flows in the complete random-lengths network
- Cost distributions in large combinatorial optimisation problems
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- A stochastic complex network model
- Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model
- A survey of max-type recursive distributional equations
- The mean field traveling salesman and related problems
- Learning-based TSP-solvers tend to be overly greedy
- Near-minimal spanning trees: A scaling exponent in probability models
This page was built for publication: Scaling and universality in continuous length combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460806)