Obtaining test problems via Internet

DOI10.1007/BF02404002MaRDI QIDQ1918988zbMATH OpenOpenAlexFDO

Authors J. E. Beasley

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

zbMATH Keywords

Internettest problems

Mathematics Subject Classification ID

Mathematical programming (90C99)

Recommendations

• More test examples for nonlinear programming codes
• scientific article; zbMATH DE number 1786146
• Sparse matrix test problems
• CUTE

Cited in

(33)

• Computing minimal doubly resolving sets of graphs
• Variable neighborhood search for the heaviest \(k\)-subgraph
• Heuristics for cardinality constrained portfolio optimization
• Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
• Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
• Deterministic job-shop scheduling: Past, present and future
• An evolutionary heuristic for the index tracking problem.
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
• Path relinking for unconstrained binary quadratic programming
• Iterated greedy for the maximum diversity problem
• A hybrid metaheuristic method for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• A multiplicative weights update algorithm for MINLP
• Metaheuristic applications on discrete facility location problems: a survey
• Solving the aircraft landing problem with time discretization approach
• Solving the simple plant location problem by genetic algorithm
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
• GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• Metaheuristic algorithms
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
• Diversification-driven tabu search for unconstrained binary quadratic problems
• A hybrid metaheuristic approach to solving the UBQP problem
• New formulations of the multiple sequence alignment problem
• A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes
• A simple tabu search for warehouse location
• A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
• Computing the metric dimension of graphs by genetic algorithms
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
• Genetic algorithms for solving the discrete ordered median problem

This page was built for publication: Obtaining test problems via Internet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918988)