Pages that link to "Item:Q541991"
From MaRDI portal
The following pages link to Adaptive memory programming for matrix bandwidth minimization (Q541991):
Displaying 8 items.
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955) (← links)
- A hybrid technique bandwidth problem for a matrix (Q2893589) (← links)
- Bio-inspired components for a bandwidth problem (Q2893600) (← links)
- (Q5692642) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)