Methods of local optimization for the problem of permutating bipartite graphs

DOI10.1016/0041-5553(84)90164-2MaRDI QIDQ3720648zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(84)90164-2

zbMATH Keywords

bipartite graphsquadratic assignment problem

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• Local optimization on graphs
• Local optimization of colorings of graphs
• Bipartite permutation graphs with application to the minimum buffer size problem
• scientific article; zbMATH DE number 1896992
• Local metaheuristics and graph partitioning
• OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS
• Methods of local search for a problem on the permutation of the columns of a binary matrix
• A local algorithm and its percolation analysis of bipartite z-matching problem

This page was built for publication: Methods of local optimization for the problem of permutating bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720648)