Pages that link to "Item:Q5378639"
From MaRDI portal
The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Modeling supermarket re-layout from the owner's perspective (Q271919) (← links)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← 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)
- Calibrating cross-training to meet demand mix variation and employee absence (Q320699) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← 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)
- A bi-objective model for the used oil location-routing problem (Q337643) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
- Minisum and maximin aerial surveillance over disjoint rectangles (Q518456) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← 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)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- Exact and heuristic procedures for the material handling circular flow path design problem (Q852933) (← links)
- General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Classification of travelling salesman problem formulations (Q911990) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)