Pages that link to "Item:Q918865"

The following pages link to Facet identification for the symmetric traveling salesman polytope (Q918865):

Displaying 48 items.

• The static bicycle relocation problem with demand intervals (Q296779) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• On the domino-parity inequalities for the STSP (Q985309) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• New inequalities for the general routing problem (Q1278493) (← links)
• A fast optimization method based on a hierarchical strategy for the travelling salesman problem (Q1330340) (← links)
• The pickup and delivery problem: Faces and branch-and-cut algorithm (Q1368475) (← links)
• A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• An optimality cut for mixed integer linear programs (Q1809846) (← links)
• Combinatorial optimization and small polytopes (Q1814809) (← links)
• The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic (Q1908998) (← links)
• Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
• Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation (Q2029903) (← links)
• Mincut sensitivity data structures for the insertion of an edge (Q2165037) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors (Q2262901) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
• Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
• A procedure of facet composition for the Symmetric Traveling Salesman Polytope (Q2816128) (← links)
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem (Q3030581) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem (Q3057161) (← links)
• (Q3115270) (← links)
• Facets of the Asymmetric Traveling Salesman Polytope (Q3971736) (← links)
• Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
• Shuffling heuristics for the storage location assignment in an AS/RS (Q4399000) (← links)
• Provably good solutions for the traveling salesman problem (Q4698114) (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
• The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
• Separating clique tree and bipartition inequalities in polynomial time (Q5101404) (← links)
• On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)
• The consistent production routing problem (Q6064169) (← links)
• Modeling the flying sidekick traveling salesman problem with multiple drones (Q6065831) (← links)
• An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (Q6142940) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)