A branch-and-cut algorithm for the preemptive swapping problem (Q2913951): Difference between revisions

@@ Property / DOI @@
-.1002/net.20447
@@ Property / DOI: 10.1002/net.20447 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20447
@@ Property / full work available at URL: https://doi.org/10.1002/net.20447 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2134465458
@@ Property / OpenAlex ID: W2134465458 / rank @@
+Normal rank
@@ Property / cites work @@
+The swapping problem
@@ Property / cites work: The swapping problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Swapping Problem on a Line
@@ Property / cites work: The Swapping Problem on a Line / rank @@
+Normal rank
@@ Property / cites work @@
+The preemptive swapping problem on a tree
@@ Property / cites work: The preemptive swapping problem on a tree / rank @@
+Normal rank
@@ Property / cites work @@
+A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
+Normal rank
@@ Property / cites work @@
+The precedence-constrained asymmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+A branch‐and‐cut algorithm for the nonpreemptive swapping problem
+Normal rank
@@ Property / cites work @@
+Heuristics for the mixed swapping problem
@@ Property / cites work: Heuristics for the mixed swapping problem / rank @@
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and weakly hamiltonian graphs
@@ Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+An inexact algorithm for the sequential ordering problem
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem I: Inequalities
+Normal rank
@@ Property / cites work @@
+Q4763403
@@ Property / cites work: Q4763403 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
+Normal rank
@@ Property / cites work @@
+The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
+Normal rank
@@ Property / cites work @@
+Multistars, partial multistars and the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
+Normal rank
@@ Property / DOI @@
+.1002/NET.20447
@@ Property / DOI: 10.1002/NET.20447 / rank @@
+Normal rank