Pages that link to "Item:Q4371607"
From MaRDI portal
The following pages link to Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607):
Displaying 38 items.
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Designing the master schedule for demand-adaptive transit systems (Q1761898) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Determination of optimal path under approach and exit constraints (Q1847171) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- An exact method for scheduling a yard crane (Q2256284) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- A learning based algorithm for drone routing (Q2669632) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (Q3362088) (← links)
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823) (← links)
- SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES (Q4006123) (← links)
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (Q4392516) (← links)
- Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem (Q4661165) (← links)
- Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)
- Towards backbone computing: A Greedy-Whitening based approach (Q5145436) (← links)
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)
- Exact models for the flying sidekick traveling salesman problem (Q6071072) (← links)
