Pages that link to "Item:Q4894874"

The following pages link to The symmetric generalized traveling salesman polytope (Q4894874):

Displaying 33 items.

• A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands (Q325450) (← links)
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
• A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
• Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
• A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
• SONET/SDH ring assignment with capacity constraints (Q1399114) (← links)
• Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
• A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
• Generalized network design problems. (Q1810478) (← links)
• The Steiner cycle polytope (Q1873013) (← links)
• A note on the generalized Steiner tree polytope (Q1962028) (← links)
• An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
• A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
• (Q2741333) (← links)
• A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem (Q2942467) (← links)
• Generalized network design polyhedra (Q3100692) (← links)
• Discrete/Binary Approach (Q3649626) (← links)
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm (Q4458720) (← links)
• On generalized minimum spanning trees (Q5945860) (← links)
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)