Pages that link to "Item:Q2008804"
From MaRDI portal
The following pages link to Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804):
Displaying 3 items.
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)