Obtaining test problems via Internet
From MaRDI portal
Publication:1918988
DOI10.1007/BF02404002zbMath0848.90126OpenAlexW4253848987MaRDI QIDQ1918988
Publication date: 23 July 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02404002
Related Items
A population heuristic for constrained two-dimensional non-guillotine cutting, Metaheuristic Algorithms, Solving the aircraft landing problem with time discretization approach, Iterated tabu search for the maximum diversity problem, Computing the metric dimension of graphs by genetic algorithms, Probabilistic GRASP-tabu search algorithms for the UBQP problem, A multiplicative weights update algorithm for MINLP, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, Diversification-driven tabu search for unconstrained binary quadratic problems, Solving the robust two-stage capacitated facility location problem with uncertain transportation costs, Genetic algorithms for solving the discrete ordered median problem, A hybrid metaheuristic approach to solving the UBQP problem, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, New formulations of the multiple sequence alignment problem, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem, Path relinking for unconstrained binary quadratic programming, Solving the simple plant location problem by genetic algorithm, A simple tabu search for warehouse location, Iterated greedy for the maximum diversity problem, A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes, Computing minimal doubly resolving sets of graphs, Deterministic job-shop scheduling: Past, present and future, GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS, An evolutionary heuristic for the index tracking problem., Variable neighborhood search for the heaviest \(k\)-subgraph, Heuristics for cardinality constrained portfolio optimization, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, A hybrid metaheuristic method for the maximum diversity problem, Metaheuristic applications on discrete facility location problems: a survey
