GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
From MaRDI portal
Publication:4427360
DOI10.1287/ijoc.11.1.44zbMath1092.90544OpenAlexW2099861483MaRDI QIDQ4427360
Publication date: 16 December 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.11.1.44
Related Items
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, A GRASP approach for the extended car sequencing problem, Multiobjective GRASP with path relinking, Heuristics for the constrained incremental graph drawing problem, Investigation of a new GRASP-based clustering algorithm applied to biological data, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, 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, 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, A hybrid multistart heuristic for the uncapacitated facility location problem, Heuristics for the capacitated modular hub location problem, Tabu search for the dynamic bipartite drawing problem, Branch and bound algorithms for the multidimensional assignment 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, A review on discrete diversity and dispersion maximization from an OR perspective, Metaheuristics: A Canadian Perspective, A rearrangement of adjacency matrix based approach for solving the crossing minimization problem, Revised GRASP with path-relinking for the linear ordering problem, An efficient compact quadratic convex reformulation for general integer quadratic programs, Variable neighborhood scatter search for the incremental graph drawing problem, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A biased random-key genetic algorithm for data clustering, GRASP and path relinking for the matrix bandwidth minimization., GRASP for set packing problems., Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, Seeking global edges for traveling salesman problem in multi-start search, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Adaptive memory programming for the robust capacitated international sourcing problem, A new modeling and solution approach for the set-partitioning problem, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Tabu search tutorial. A graph drawing application, Rejoinder on: ``Tabu search tutorial. A graph drawing application, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Balancing and scheduling tasks in assembly lines with sequence-dependent setup times, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, Restart strategies for GRASP with path-relinking heuristics, A fast swap-based local search procedure for location problems, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, A path relinking approach for the team orienteering problem, Black box scatter search for general classes of binary optimization problems, Greedy random adaptive memory programming search for the capacitated clustering problem, Randomized heuristics for the Max-Cut problem, Incremental bipartite drawing problem, Hybridizations of GRASP with path relinking for the far from most string problem, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, GRASP with Path-Relinking for Facility Layout, Randomized heuristics for the family traveling salesperson problem, GRASP with path-relinking for the generalized quadratic assignment problem, GRASP with path relinking heuristics for the antibandwidth problem, GRASP and path relinking for the max-min diversity problem, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, Lot-sizing for production planning in a recovery system with returns, Hybrid algorithms for placement of virtual machines across geo-separated data centers, 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, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning, Metaheuristics in combinatorial optimization
Uses Software
