Intensification and diversification with elite tabu search solutions for the linear ordering problem
From MaRDI portal
Publication:1302560
DOI10.1016/S0305-0548(98)00104-XzbMath1016.90081MaRDI QIDQ1302560
Vicente Campos, Manuel Laguna, Rafael Martí
Publication date: 2 March 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem, A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches, The linear ordering problem revisited, A memetic algorithm with dynamic population management for an integrated production-distribution problem, Tabu search and GRASP for the maximum diversity problem, A survey on the linear ordering problem for weighted or unweighted tournaments, Testing probabilistic models of choice using column generation, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Ranking data with ordinal labels: optimality and pairwise aggregation, Revised GRASP with path-relinking for the linear ordering problem, A linear ordering problem with weighted rank, A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems, A benchmark library and a comparison of heuristic methods for the linear ordering problem, Randomized Algorithms for Lexicographic Inference, A unified framework for population-based metaheuristics, On VLSI interconnect optimization and linear ordering problem, Scatter search and genetic algorithms for MAX-SAT problems, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, Efficient local search algorithms for the linear ordering problem, Adaptive memory in multistart heuristics for multicommodity network design, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Adaptive memory programming for matrix bandwidth minimization, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The linear ordering problem: instances, search space analysis and algorithms, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, Variable neighborhood search for the linear ordering problem, Block-insertion-based algorithms for the linear ordering problem, A matheuristic for the generalized order acceptance and scheduling problem, Probabilistic transitivity in sports, Workload balancing and loop layout in the design of a flexible manufacturing system, Principles of scatter search, Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem, Tabu search directed by direct search methods for nonlinear global optimization, Comparing metaheuristic algorithms for SONET network design problems, An unconstrained quadratic binary programming approach to the vertex coloring problem
Uses Software
