Cost distributions in large combinatorial optimisation problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4133843
- Scaling and universality in continuous length combinatorial optimization
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Phase Transitions in Combinatorial Optimization Problems
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
Cited in
(4)- Anomalous scaling of the optimal cost in the one-dimensional random assignment problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- Scaling and universality in continuous length combinatorial optimization
This page was built for publication: Cost distributions in large combinatorial optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487148)