Pages that link to "Item:Q2462559"

The following pages link to Solving the variable size bin packing problem with discretized formulations (Q2462559):

Displaying 36 items.

• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
• Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
• The single period coverage facility location problem: Lagrangean heuristic and column generation approaches (Q610996) (← links)
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
• Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
• Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
• Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
• Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• A bin packing approach to solve the aircraft maintenance task allocation problem (Q2031115) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem (Q2147064) (← links)
• The freight consolidation and containerization problem (Q2256168) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• Three-stage heuristic algorithm for three-dimensional irregular packing problem (Q2284451) (← links)
• New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
• Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← links)
• The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• On the generalized bin packing problem (Q5278218) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• A machine learning optimization approach for last-mile delivery and third-party logistics (Q6106567) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• On the Impact of Fuzzy Constraints in the Variable Size and Cost Bin Packing Problem (Q6485320) (← links)
• A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem (Q6536478) (← links)