Pages that link to "Item:Q2340275"

The following pages link to Friendly bin packing instances without integer round-up property (Q2340275):

Displaying 18 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← 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)
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
• Large proper gaps in bin packing and dual bin packing problems (Q2423816) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)