Pages that link to "Item:Q1089267"
From MaRDI portal
The following pages link to Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267):
Displaying 50 items.
- Fuzzy commercial traveler problem of trapezoidal membership functions within the sort of \(\alpha \) optimum solution using ranking technique (Q258380) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Computing minimal forecast horizons: an integer programming approach (Q853795) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- The discipline number of a graph (Q1174136) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- A parallel tabu search algorithm for large traveling salesman problems (Q1329785) (← links)
- Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Integrating rolling stock scheduling with train unit shunting (Q1751830) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
