Pages that link to "Item:Q4367232"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232):
Displayed 24 items.
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- The generalized fixed-charge network design problem (Q856677) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- A new relaxation method for the generalized minimum spanning tree problem (Q2575572) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- Discrete/Binary Approach (Q3649626) (← links)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- (Q4934874) (← links)
- A Sensitive Metaheuristic for Solving a Large Optimization Problem (Q5448681) (← links)
- Cluster-level operations planning for the out-of-position robotic arc-welding (Q5478828) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)