Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782): Difference between revisions

@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+An outer-approximation algorithm for a class of mixed-integer nonlinear programs
+Normal rank
@@ Property / cites work @@
+Q4331736
@@ Property / cites work: Q4331736 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Benders decomposition
@@ Property / cites work: Generalized Benders decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
+Normal rank
@@ Property / cites work @@
+The trim-loss and assortment problems: A survey
@@ Property / cites work: The trim-loss and assortment problems: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+An Automatic Method of Solving Discrete Programming Problems
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Programming Problems Using Automatic Reformulation
+Normal rank
@@ Property / cites work @@
+An LP-based approach to cutting stock problems with multiple objectives
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(97)00066-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1970686413
@@ Property / OpenAlex ID: W1970686413 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127442499
@@ Property / Wikidata QID: Q127442499 / rank @@
+Normal rank