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.

• A note on the generalized Steiner tree polytope (Q1962028) (← links)
• An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
• Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
• A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
• Liner shipping network design (Q2184083) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• The clustered team orienteering problem (Q2273693) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
• Particle swarm optimization-based algorithms for TSP and generalized TSP (Q2379966) (← links)
• New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← 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 mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
• The generalized covering salesman problem (Q2815466) (← links)
• Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
• A variable neighborhood search and its application to a ring star problem generalization (Q2883580) (← links)
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
• A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem (Q2942467) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
• Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem (Q3057161) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• Some Applications of the Generalized Travelling Salesman Problem (Q4344427) (← links)
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem (Q4392516) (← 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)
• Eulerian location problems (Q4934874) (← links)
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size (Q4979994) (← 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)
• Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem (Q5888090) (← links)
• Facets of the \(p\)-cycle polytope (Q5946821) (← links)
• Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720) (← links)
• A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)