Pages that link to "Item:Q2462146"
From MaRDI portal
The following pages link to A branch and bound algorithm for the matrix bandwidth minimization (Q2462146):
Displaying 19 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type (Q645734) (← links)
- Finding exact solutions to the bandwidth minimization problem (Q1300222) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- Band-restricted diagonally dominant matrices: computational complexity and application (Q1713483) (← links)
- Scatter search for the cutwidth minimization problem (Q1761768) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Data-mining-driven neighborhood search (Q2815441) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- A hybrid algorithm for reducing matrix bandwidth (Q3340028) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)
