The following pages link to Concorde (Q16936):
Displaying 50 items.
- Using a TSP heuristic for routing order pickers in warehouses (Q1044093) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Constrained discriminant analysis via \(0/1\) mixed integer programming (Q1374279) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Parallel branch, cut, and price for large-scale discrete optimization (Q1424299) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach (Q1651527) (← links)
- The driver and vehicle routing problem (Q1651584) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
- A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- Bi-objective data gathering path planning for vehicles with bounded curvature (Q1652333) (← links)
- Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
- A multi-phase heuristic for the production routing problem (Q1652406) (← links)
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- A hybrid approach for biobjective optimization (Q1662163) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics (Q1666410) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Complexity of graphs generated by wheel graph and their asymptotic limits (Q1686390) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- Compact extended linear programming models (Q1693865) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)
- Number of spanning trees of different products of complete and complete bipartite graphs (Q1719484) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- Application of imperialist competitive algorithm on solving the traveling salesman problem (Q1736616) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications (Q1750463) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- Worst-case demand distributions in vehicle routing (Q1752215) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
- A library hierarchy for implementing scalable parallel search algorithms (Q1771087) (← links)
