Concorde
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Certification of an optimal TSP tour through 85,900 cities
- Computational experience with general cutting planes for the set covering problem
- Local cuts revisited
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Using a TSP heuristic for routing order pickers in warehouses
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- ALPS
- GILK
- Exact SCIP
- CSGNet
- SeaPearl
- PaPILO
- HGS-CVRP
- SNDlib
- TSPLIB
- Constrained discriminant analysis via \(0/1\) mixed integer programming
- VRPH
- ZRAM
- SCIL
- Transformations of generalized ATSP into ATSP.
- Parallel branch, cut, and price for large-scale discrete optimization
- BIANCA
- PICO
- SALSA
- ABACUS
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
- The driver and vehicle routing problem
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- An exact algorithm for a vehicle-and-driver scheduling problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Bi-objective data gathering path planning for vehicles with bounded curvature
- Solving large batches of traveling salesman problems with parallel and distributed computing
- A multi-phase heuristic for the production routing problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- An efficient evolutionary algorithm for the orienteering problem
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- A hybrid approach for biobjective optimization
- Mathematical programming in computational biology: an annotated bibliography
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- MINTO
- The traveling salesman problem on grids with forbidden neighborhoods
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- BoneRoute
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Complexity of graphs generated by wheel graph and their asymptotic limits
- TSPTW
- Continuous approximation models in freight distribution management
- SYMPHONY
- QSopt_ex
- TSP software
- LKH
- QUALEX
- Compact extended linear programming models
- Blossom V
- The late acceptance hill-climbing heuristic
- Efficient filtering for the resource-cost alldifferent constraint
- PORTA
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem
- BonsaiG
- LEMON
- BG-WalkSAT
- Number of spanning trees of different products of complete and complete bipartite graphs
- Heuristics for vehicle routing problems: sequence or set optimization?
- QSopt-Exact
- Solving the traveling salesman problem with interdiction and fortification
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem
- VRP
- Dubins traveling salesman problem with neighborhoods: a graph-based approach
- Application of imperialist competitive algorithm on solving the traveling salesman problem
- BPPLIB: a library for bin packing and cutting stock problems
- Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications
- Binary Steiner trees: structural results and an exact solution approach
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
- The windy rural postman problem with a time-dependent zigzag option
- Worst-case demand distributions in vehicle routing
- An experimental comparison of seriation methods for one-mode two-way data
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
- Efficient algorithms for the double traveling salesman problem with multiple stacks
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- A library hierarchy for implementing scalable parallel search algorithms
- Complexity reduction preserving dynamical behavior of biochemical networks
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance
- Economic model predictive inventory routing and control
- A computational comparison of flow formulations for the capacitated location-routing problem
- A credibilistic goal programming model for inventory routing problem with hazardous materials
- METSlib
- A branch-and-cut algorithm for capacitated network design problems
- BiCePS
- Cardinal
- libcgrpp
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- Could we use a million cores to solve an integer program?
- A brief history of NP-completeness, 1954--2012
- PLplot
This page was built for software: Concorde
