Pages that link to "Item:Q342316"

The following pages link to Bin packing and related problems: general arc-flow formulation with graph compression (Q342316):

Displaying 36 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
• The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• Multi-warehouse package consolidation for split orders in online retailing (Q2029283) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• On the benchmark instances for the bin packing problem with conflicts (Q2056901) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← 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)
• A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• Algorithms for the bin packing problem with scenarios (Q6646755) (← links)