Pages that link to "Item:Q1290171"
From MaRDI portal
The following pages link to Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171):
Displaying 8 items.
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Heuristic algorithms based on column generation for an online product shipping problem (Q6065593) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← 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)
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model (Q6573359) (← links)