Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879): Difference between revisions

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / 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.1007/s11750-011-0212-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2044875762
@@ Property / OpenAlex ID: W2044875762 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity network design with discrete node costs
+Normal rank
@@ Property / cites work @@
+Reformulation by discretization: application to economic lot sizing
+Normal rank
@@ Property / cites work @@
+Solving the variable size bin packing problem with discretized formulations
+Normal rank
@@ Property / cites work @@
+Discretized formulations for capacitated location problems with modular distribution costs
+Normal rank
@@ Property / cites work @@
+A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds for the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A note on hop-constrained walk polytopes.
@@ Property / cites work: A note on hop-constrained walk polytopes. / rank @@
+Normal rank
@@ Property / cites work @@
+On the directed hop-constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+-1 reformulations of the multicommodity capacitated network design problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Q2861520
@@ Property / cites work: Q2861520 / rank @@
+Normal rank
@@ Property / cites work @@
+Prize collecting Steiner trees with node degree dependent costs
+Normal rank
@@ Property / cites work @@
+On the capacitated concentrator location problem: a reformulation by discretization
+Normal rank
@@ Property / cites work @@
+A classification of formulations for the (time-dependent) traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Extended and discretized formulations for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank