Pages that link to "Item:Q1919842"
From MaRDI portal
The following pages link to A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842):
Displaying 11 items.
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery (Q6659827) (← links)
