The following pages link to Bison (Q29535):
Displayed 42 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
- On solving the double loading problem using a modified particle swarm optimization (Q496039) (← links)
- A particle swarm optimizer for grouping problems (Q497654) (← 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)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← 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)
- Grouping evolution strategies: an effective approach for grouping problems (Q2009978) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- New lower bounds for the three-dimensional orthogonal bin packing problem (Q2253499) (← links)
- Multiple-source learning precedence graph concept for the automotive industry (Q2256196) (← 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)
- Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← 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)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems (Q5739138) (← links)
- New heuristics for one-dimensional bin-packing (Q5959374) (← links)