The following pages link to Concorde (Q16936):
Displayed 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
- The salesman and the tree: the importance of search in CP (Q272000) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- The clustered orienteering problem (Q296772) (← links)
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
- An optimal path planning problem for heterogeneous multi-vehicle systems (Q326212) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Single liner shipping service design (Q336948) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem (Q342444) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading (Q421561) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain (Q433075) (← links)
- Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
- Certifying algorithms (Q465678) (← links)
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Scaling laws for maximum coloring of random geometric graphs (Q516873) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)