A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141): Difference between revisions

@@ Property / cites work @@
+Matching problems with generalized upper bound side constraints
+Normal rank
@@ Property / cites work @@
+Q4026988
@@ Property / cites work: Q4026988 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
+Normal rank
@@ Property / cites work @@
+A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
+Normal rank
@@ Property / cites work @@
+Optimal set partitioning, matchings and lagrangian duality
+Normal rank
@@ Property / cites work @@
+Q5566712
@@ Property / cites work: Q5566712 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization with nonsmooth data
@@ Property / cites work: Optimization with nonsmooth data / rank @@
+Normal rank