Pages that link to "Item:Q4367232"

The following pages link to A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232):

Displaying 50 items.

• Optimal capacitated ring trees (Q286687) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
• A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
• Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms (Q621973) (← links)
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
• Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
• On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← 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)
• A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
• A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
• The probabilistic orienteering problem (Q1652250) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout (Q1681433) (← links)
• Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants (Q1734334) (← links)
• The set orienteering problem (Q1754239) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← 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)