GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
From MaRDI portal
Cited in
(79)- GRASP and path relinking for the max-min diversity problem
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP for set packing problems.
- Heuristics for the constrained incremental graph drawing problem
- Intelligent-guided adaptive search for the maximum covering location problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Heuristics for the capacitated modular hub location problem
- Tabu search for the dynamic bipartite drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Tabu search tutorial. A graph drawing application
- Rejoinder on: ``Tabu search tutorial. A graph drawing application
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- A biased random-key genetic algorithm for data clustering
- Adaptive memory programming for the robust capacitated international sourcing problem
- A new modeling and solution approach for the set-partitioning problem
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- A fast swap-based local search procedure for location problems
- Scatter search --- wellsprings and challenges
- Principles of scatter search
- Scatter search for the vehicle routing problem with time windows
- A GRASP and path relinking heuristic for rural road network development
- Multiobjective GRASP with path relinking
- A review on discrete diversity and dispersion maximization from an OR perspective
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Hybridizations of GRASP with path relinking for the far from most string problem
- GRASP with path-relinking for facility layout
- GRASP with path relinking heuristics for the antibandwidth problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- A hybrid data mining GRASP with path-relinking
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- GRASP for the uncapacitated r-allocation p-hub median problem
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
- Revised GRASP with path-relinking for the linear ordering problem
- Randomized heuristics for the Max-Cut problem
- Randomized heuristics for the family traveling salesperson problem
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- Lot-sizing for production planning in a recovery system with returns
- Branch and bound algorithms for the multidimensional assignment problem
- Incremental bipartite drawing problem
- Metaheuristics: A Canadian Perspective
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Seeking global edges for traveling salesman problem in multi-start search
- A fast path relinking algorithm for the min-max edge crossing problem
- A metaheuristic algorithm for large maximum weight independent set problems
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- Multiparent path relinking. An application to the power dominating set problem
- Restart strategies for GRASP with path-relinking heuristics
- A local search algorithm for large maximum weight independent set problems
- On the restricted Steiner multi cycle problem
- Fifty years of metaheuristics
- Greedy random adaptive memory programming search for the capacitated clustering problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- Metaheuristics in combinatorial optimization
- A GRASP approach for the extended car sequencing problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- The \(p\)-median problem: a survey of metaheuristic approaches
- A GRASP algorithm to solve the unicost set covering problem
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A path relinking approach for the team orienteering problem
- Black box scatter search for general classes of binary optimization problems
This page was built for publication: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427360)
