Pages that link to "Item:Q1194761"
From MaRDI portal
The following pages link to The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761):
Displaying 50 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
- Deterministic optimizational problems of transportation logistics (Q612223) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Evolutionary algorithms for solving multi-objective travelling salesman problem (Q656058) (← links)
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
- Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← links)
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545) (← links)
- Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study (Q1296791) (← links)
- Workload planning in small lot printed circuit board assembly (Q1374396) (← links)
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
- Current modeling practices in bank courier scheduling (Q1590431) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Application of imperialist competitive algorithm on solving the traveling salesman problem (Q1736616) (← links)
- Inventory rebalancing and vehicle routing in bike sharing systems (Q1752898) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
- Extensions to the generalised assignment heuristic for vehicle routing (Q1806768) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- Designing multi-vehicle delivery tours in a grid-cell format (Q1809842) (← links)
- A sweep-based algorithm for the fleet size and mix vehicle routing problem (Q1848592) (← links)
- A new heuristic for the period traveling salesman problem (Q1894732) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal (Q1992577) (← links)
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
- Physarum-energy optimization algorithm (Q2001152) (← links)
