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.

• Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
• An algorithm for dynamic order-picking in warehouse operations (Q320634) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• The anti-join composition and polyhedra (Q688264) (← links)
• Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
• On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
• Design and control of warehouse order picking: a literature review (Q881508) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
• Packing circuits in matroids (Q1013971) (← links)
• Using a TSP heuristic for routing order pickers in warehouses (Q1044093) (← links)
• A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
• Submodularity and the traveling salesman problem (Q1124707) (← links)
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
• The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
• On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
• A travelling salesman problem in the \(k\)-dimensional unit cube (Q1198619) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
• New inequalities for the general routing problem (Q1278493) (← links)
• The travelling salesman problem on permuted Monge matrices (Q1288469) (← links)
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
• The Steiner tree polytope and related polyhedra (Q1322552) (← links)
• Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• The Steiner tree problem. II: Properties and classes of facets (Q1330903) (← links)
• A polyhedral approach to the rural postman problem (Q1342042) (← links)
• The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
• On perfectly two-edge connected graphs (Q1363658) (← links)
• On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
• On the cut polyhedron. (Q1426123) (← links)
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
• Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
• ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
• Empirical analysis for the VRPTW with a multigraph representation for the road network (Q1651529) (← links)
• The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
• Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
• A discrete cross aisle design model for order-picking warehouses (Q1713732) (← links)
• Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)