Pages that link to "Item:Q1362971"
From MaRDI portal
The following pages link to BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971):
Displayed 24 items.
- Bison (Q29535) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- The capacity and distance constrained plant location problem (Q954059) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- A pure quasi-human algorithm for solving the cuboid packing problem (Q2267001) (← links)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization (Q2427181) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Optimization of a line-cutting procedure for ship hull construction by an effective tabu search (Q3605417) (← links)
- Cutting optimization with variable-sized stock and inventory status data (Q4468878) (← links)
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) (Q5189096) (← links)
- New heuristics for one-dimensional bin-packing (Q5959374) (← links)