scientific article; zbMATH DE number 3604272
From MaRDI portal
Publication:4170156
Cited in
(6)- The bilinear assignment problem: complexity and polynomially solvable special cases
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- Perspectives of Monge properties in optimization
- Worst case analysis of nearest neighbour algorithms for the minimum weighted directed k-cycle problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
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 Q4170156)
