Pages that link to "Item:Q1918988"
From MaRDI portal
The following pages link to Obtaining test problems via Internet (Q1918988):
Displaying 32 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Genetic algorithms for solving the discrete ordered median problem (Q884020) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- Solving the robust two-stage capacitated facility location problem with uncertain transportation costs (Q1677305) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- An evolutionary heuristic for the index tracking problem. (Q1812009) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Solving the aircraft landing problem with time discretization approach (Q2630256) (← links)
- Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS (Q3631235) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
