Pages that link to "Item:Q2482382"
From MaRDI portal
The following pages link to An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382):
Displaying 22 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Comparative analysis of three metaheuristics for short-term open pit block sequencing (Q525065) (← links)
- On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics (Q547959) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- Addressing the envelope reduction of sparse matrices using a genetic programming system (Q2352428) (← links)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- (Q2861498) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)