Pages that link to "Item:Q3780762"
From MaRDI portal
The following pages link to Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space (Q3780762):
Displayed 24 items.
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem (Q961563) (← links)
- A new method of estimation of the box-counting dimension of multivariate objects using space-filling curves (Q999906) (← links)
- The vehicle routing problem with backhauls (Q1119178) (← links)
- Cost of sequential connection for points in space (Q1122502) (← links)
- On the long edges in the shortest tour through \(n\) random points (Q1200280) (← links)
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791) (← links)
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem (Q1331556) (← links)
- A projection method for \(l_ p\) norm location-allocation problems (Q1337136) (← links)
- Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- Heuristic solutions to multi-depot location-routing problems (Q1603335) (← links)
- Two queues with non-stochastic arrivals (Q1667172) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Sorting methods and convergence rates for Array-RQMC: some empirical comparisons (Q1996950) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- Efficacy of spacefilling heuristics in Euclidean combinatorial optimization (Q2314405) (← links)
- Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem (Q2314406) (← links)
- A comparison of heuristics for the problem of batching orders for warehouse selection (Q4230089) (← links)
- Vertex-labeling algorithms for the Hilbert spacefilling curve (Q4791099) (← links)
- On solving unreliable planar location problems (Q5926602) (← links)
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands (Q5953168) (← links)