Pages that link to "Item:Q1072449"
From MaRDI portal
The following pages link to A cutting plane procedure for the travelling salesman problem on road networks (Q1072449):
Displaying 46 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
- Traveling salesman problem with transportation (Q864099) (← links)
- The dragon war (Q876681) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- The two-period travelling salesman problem applied to milk collection in Ireland (Q1356071) (← 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)
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows (Q1725604) (← links)
- Exact algorithms for the order picking problem (Q1782167) (← links)
- Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872) (← links)
- Circular Jaccard distance based multi-solution optimization for traveling salesman problems (Q2086823) (← links)
- An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- Solving the traveling circus problem by branch \& cut (Q2741339) (← links)
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
- Solution of a min-max vehicle routing problem (Q2884530) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Partial polyhedral description and generation of discrete optimization problems with known optima (Q4017559) (← links)
- A TSP (1,2) application arising in cable assembly shops (Q5464233) (← links)
- The time-dependent shortest path and vehicle routing problem (Q5889200) (← 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)
- A cutting plane algorithm for the general routing problem (Q5935711) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks (Q6169990) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)