Pages that link to "Item:Q5901735"
From MaRDI portal
The following pages link to Evolutionary Computation in Combinatorial Optimization (Q5901735):
Displaying 14 items.
- A cutting and scheduling problem in float glass manufacturing (Q398905) (← links)
- Computing minimum cuts by randomized search heuristics (Q633832) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Three-dimensional bin packing problem with variable bin height (Q1039777) (← links)
- A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem (Q2030601) (← links)
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- An optimization model for trim loss minimization in an automotive glass plant (Q2643973) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- Analysis of distributed genetic algorithms for solving cutting problems (Q3422369) (← links)
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)
