On LP relaxations for the pattern minimization problem (Q3008919): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20422
@@ Property / full work available at URL: https://doi.org/10.1002/net.20422 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2064501715
@@ Property / OpenAlex ID: W2064501715 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds based on column generation and constraint programming for the pattern minimization problem
+Normal rank
@@ Property / cites work @@
+Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
+Normal rank
@@ Property / cites work @@
+LP models for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Fast lifting procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+One-dimensional cutting stock problem to minimize the number of different patterns
+Normal rank
@@ Property / cites work @@
+Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+A generic view of Dantzig--Wolfe decomposition in mixed integer programming
+Normal rank