The following pages link to Concorde (Q16936):
Displaying 50 items.
- Complexity reduction preserving dynamical behavior of biochemical networks (Q1784362) (← links)
- Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance (Q1787317) (← links)
- Economic model predictive inventory routing and control (Q1788929) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- A credibilistic goal programming model for inventory routing problem with hazardous materials (Q1800339) (← links)
- A branch-and-cut algorithm for capacitated network design problems (Q1806022) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- A brief history of NP-completeness, 1954--2012 (Q1946035) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- Mileage bands in freight transportation (Q1991161) (← links)
- Solving travelling salesman problem using ant systems: a programmer's approach (Q2001827) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming (Q2009701) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- Preemptive stacker crane problem: extending tree-based properties and construction heuristics (Q2030604) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding (Q2117205) (← links)
- The probabilistic travelling salesman problem with crowdsourcing (Q2146980) (← links)
- Learning the travelling salesperson problem requires rethinking generalization (Q2152276) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
- A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- On one approach to TSP structural stability (Q2248701) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- A location-routing problem in glass recycling (Q2259043) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- Collaborative delivery with energy-constrained mobile robots (Q2292912) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Number of spanning trees in the sequence of some graphs (Q2325140) (← links)
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics (Q2327442) (← links)
- A scheduling problem in the baking industry (Q2336885) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- The complexity of some classes of pyramid graphs created from a gear graph (Q2337852) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
- A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
