Pages that link to "Item:Q3675933"

The following pages link to The traveling salesman problem on a graph and some related integer polyhedra (Q3675933):

Displaying 50 items.

• Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse (Q1740491) (← links)
• On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
• Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
• On survivable network polyhedra (Q1772416) (← links)
• Exact algorithms for the order picking problem (Q1782167) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
• The general routing polyhedron: A unifying framework (Q1806888) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
• On the distance-constrained close enough arc routing problem (Q2029943) (← links)
• An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
• The graphical traveling salesperson problem has no integer programming formulation in the original space (Q2060618) (← links)
• Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
• Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals (Q2180182) (← links)
• An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
• \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
• On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
• Good triangulations yield good tours (Q2384914) (← links)
• On the general routing polytope (Q2473035) (← links)
• Traveling salesman path problems (Q2476987) (← links)
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
• \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
• The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
• Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
• Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Box-total dual integrality and edge-connectivity (Q2689821) (← links)
• Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey (Q2772854) (← links)
• Routing optimization under uncertainty (Q2806069) (← links)
• Cut dominants and forbidden minors (Q2818204) (← links)
• Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
• TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
• Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• (Q3115270) (← links)
• On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
• On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
• An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
• Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
• Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)