Pages that link to "Item:Q1847189"

The following pages link to LP models for bin packing and cutting stock problems (Q1847189):

Displaying 43 items.

• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• Single workgroup scheduling problem with variable processing personnel (Q2173005) (← links)
• An exact model for a slitting problem in the steel industry (Q2239876) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem (Q2242390) (← links)
• Heuristics for packing semifluids (Q2286867) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Friendly bin packing instances without integer round-up property (Q2340275) (← links)
• A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
• Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
• Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• Multi-objective temporal bin packing problem: an application in cloud computing (Q2664301) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Online Bin Packing with (1,1) and (2,R) Bins (Q2867137) (← links)
• Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• On LP relaxations for the pattern minimization problem (Q3008919) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap (Q4596192) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• Lp-Based Method For The Multi-Sheet Cutting Stock Problem (Q4834077) (← links)
• Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Recursive algorithm for the two‐dimensional cutting problem of punched strips (Q5190526) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
• The cutting stock problem applied to the hardening process in an automotive spring factory (Q6161253) (← links)
• The two-dimensional cutting stock problem within the roller blind production process (Q6573721) (← links)