The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206): Difference between revisions

@@ Property / describes a project that uses @@
+CVRPSP
@@ Property / describes a project that uses: CVRPSP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2016.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2566858588
@@ Property / OpenAlex ID: W2566858588 / rank @@
+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 @@
+Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Vehicle Routing
@@ Property / cites work: Vehicle Routing / rank @@
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+On the capacitated vehicle routing problem
@@ Property / cites work: On the capacitated vehicle routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating capacity constraints in the CVRP using tabu search
+Normal rank
@@ Property / cites work @@
+Easy and difficult objective functions for max cut
+Normal rank
@@ Property / cites work @@
+Q4532225
@@ Property / cites work: Q4532225 / rank @@
+Normal rank
@@ Property / cites work @@
+Two node-disjoint hop-constrained survivable network design and polyhedra
+Normal rank
@@ Property / cites work @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+A branch-and-cut for the Non-Disjoint<i>m</i>-Ring-Star Problem
+Normal rank
@@ Property / cites work @@
+Minimizing submodular functions over families of sets
+Normal rank
@@ Property / cites work @@
+Q5292089
@@ Property / cites work: Q5292089 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+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 @@
+Integer Programming and Combinatorial Optimization
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1751206