Pages that link to "Item:Q4427360"
From MaRDI portal
The following pages link to GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization (Q4427360):
Displaying 50 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A GRASP approach for the extended car sequencing problem (Q835577) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times (Q941547) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Tabu search tutorial. A graph drawing application (Q1979170) (← links)
- Rejoinder on: ``Tabu search tutorial. A graph drawing application'' (Q1979172) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
- Investigation of a new GRASP-based clustering algorithm applied to biological data (Q2379645) (← links)
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
- A biased random-key genetic algorithm for data clustering (Q2436000) (← links)
- Adaptive memory programming for the robust capacitated international sourcing problem (Q2456637) (← links)
