Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

From MaRDI portal
(Redirected from Publication:4766036)





No records found





Cited in

No records found








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 )