Solving robust bin-packing problems with a branch-and-price approach (Q2060393): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2021.05.041
@@ Property / DOI: 10.1016/j.ejor.2021.05.041 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3168953250
@@ Property / OpenAlex ID: W3168953250 / rank @@
+Normal rank
@@ Property / cites work @@
+Rounding and Propagation Heuristics for Mixed Integer Programming
+Normal rank
@@ Property / cites work @@
+On the cutting stock problem under stochastic demand
+Normal rank
@@ Property / cites work @@
+A branch-and-price-and-cut approach for sustainable crop rotation planning
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
+Normal rank
@@ Property / cites work @@
+Heuristics of the Branch-Cut-and-Price-Framework SCIP
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+A classification of assembly line balancing problems
+Normal rank
@@ Property / cites work @@
+Operating room planning and scheduling: a literature review
+Normal rank
@@ Property / cites work @@
+Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
+Normal rank
@@ Property / cites work @@
+Decomposition Principle for Linear Programs
@@ Property / cites work: Decomposition Principle for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing and cutting stock problems: mathematical models and exact algorithms
+Normal rank
@@ Property / cites work @@
+A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+Robust branch-and-cut-and-price for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+A stochastic model for operating room planning with elective and emergency demand for surgery
+Normal rank
@@ Property / cites work @@
+The omnipresence of Lagrange
@@ Property / cites work: The omnipresence of Lagrange / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
+Normal rank
@@ Property / cites work @@
+Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
+Normal rank
@@ Property / cites work @@
+Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
+Normal rank
@@ Property / cites work @@
+Stability analysis of an optimal balance for an assembly line with fixed cycle time
+Normal rank
@@ Property / cites work @@
+Dynamic programming algorithms for the zero-one knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving binary cutting stock problems by column generation and branch- and-bound
+Normal rank
@@ Property / cites work @@
+On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
+Normal rank
@@ Property / cites work @@
+ZI round, a MIP rounding heuristic
@@ Property / cites work: ZI round, a MIP rounding heuristic / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for the integer one-dimensional cutting stock problem: A computational study
+Normal rank
@@ Property / cites work @@
+A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2021.05.041
@@ Property / DOI: 10.1016/J.EJOR.2021.05.041 / rank @@
+Normal rank