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):
Displayed 14 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)
- 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)
- Data-Mining-Driven Neighborhood Search (Q2815441) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← 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)
- On integer linear programs for treewidth based on perfect elimination orderings (Q6182913) (← links)