The following pages link to TSPLIB (Q13727):
Displaying 50 items.
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms (Q257224) (← links)
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Robust optimization for routing problems on trees (Q301384) (← links)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems (Q316285) (← links)
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem (Q323162) (← links)
- New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412) (← links)
- \(p\)-facility Huff location problem on networks (Q323476) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
- Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
- An immune memory clonal algorithm for numerical and combinatorial optimization (Q352025) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain (Q433075) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
