Heuristics for the min-max arc crossing problem in graphs.

•A heuristic method to improve the readability of graphs.•A crossing reduction method for graph drawing expert systems.•A mathematical programming formulation for the min–max arc crossing problem.•An empirical comparison with the best existing method, including expert systems.•Extensive computational results and statistical testing to compare methods.