Pages that link to "Item:Q5671788"
From MaRDI portal
The following pages link to An Effective Heuristic Algorithm for the Traveling-Salesman Problem (Q5671788):
Displayed 50 items.
- The clustered orienteering problem (Q296772) (← links)
- Master surgery scheduling with consideration of multiple downstream units (Q297106) (← links)
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- Classical simulated annealing using quantum analogues (Q321328) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations (Q323012) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- A simulated annealing heuristic for the open location-routing problem (Q337651) (← links)
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
- Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Social structure optimization in team formation (Q342472) (← links)
- Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- A variable depth search branching (Q453047) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On fast trust region methods for quadratic models with linear constraints (Q499155) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- A \(k\)-level data structure for large-scale traveling salesman problems (Q512957) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Shift-and-propagate (Q524884) (← links)
- A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
- A solution approach to the inventory routing problem in a three-level distribution system (Q541738) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
- A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)