Pages that link to "Item:Q5139850"

The following pages link to Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850):

Displaying 25 items.

• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• The vehicle routing problem with heterogeneous locker boxes (Q2033310) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← 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)
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← 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)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)
• Half-cycle: a new formulation for modelling kidney exchange problems (Q6106526) (← links)
• The transportation problem with packing constraints (Q6106585) (← 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)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• Tool switching problems with tool order constraints (Q6202949) (← links)