Exact methods for solving the elementary shortest and longest path problems (Q512936): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-016-2116-5
@@ Property / DOI: 10.1007/s10479-016-2116-5 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-016-2116-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2273056006
@@ Property / OpenAlex ID: W2273056006 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching rules revisited
@@ Property / cites work: Branching rules revisited / rank @@
+Normal rank
@@ Property / cites work @@
+A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
+Normal rank
@@ Property / cites work @@
+Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
+Normal rank
@@ Property / cites work @@
+A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
+Normal rank
@@ Property / cites work @@
+Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
+Normal rank
@@ Property / cites work @@
+An algorithm for the resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Mixed-integer nonlinear optimization
@@ Property / cites work: Mixed-integer nonlinear optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Accelerated label setting algorithms for the elementary resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Reduction tests for the prize-collecting Steiner problem
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Tree Problems With Profits
@@ Property / cites work: Steiner Tree Problems With Profits / rank @@
+Normal rank
@@ Property / cites work @@
+On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Solving elementary shortest-path problems as mixed-integer programs
+Normal rank
@@ Property / cites work @@
+Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Facets of the Asymmetric Traveling Salesman Polytope
+Normal rank
@@ Property / cites work @@
+Q4461906
@@ Property / cites work: Q4461906 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763416
@@ Property / cites work: Q4763416 / rank @@
+Normal rank
@@ Property / cites work @@
+A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
+Normal rank
@@ Property / cites work @@
+Shortest Path Problems with Resource Constraints
@@ Property / cites work: Shortest Path Problems with Resource Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and cut algorithm for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Steiner tree problems in graphs to optimality
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q2861509
@@ Property / cites work: Q2861509 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+Facet identification for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461903
@@ Property / cites work: Q4461903 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
+Normal rank
@@ Property / cites work @@
+New dynamic programming algorithms for the resource constrained elementary shortest path problem
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10479-016-2116-5
@@ Property / DOI: 10.1007/S10479-016-2116-5 / rank @@
+Normal rank