scientific article; zbMATH DE number 3618052
From MaRDI portal
Publication:4182679
Cited in
(4)- Continuous representations and functional extensions in combinatorial optimization
- Continuous extensions on Euclidean combinatorial configurations
- The polyhedral-surface cutting plane method of optimization over a vertex-located set
- The k-Opt algorithm for the traveling salesman problem has exponential running time for k 5
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182679)