Pages that link to "Item:Q1268138"
From MaRDI portal
The following pages link to A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138):
Displaying 13 items.
- The stochastic trim-loss problem (Q1011257) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- Composite stock cutting through simulated annealing (Q1197089) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- Simulated annealing for order spread minimization in sequencing cutting patterns (Q1303575) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets (Q2488902) (← links)
- A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem (Q2901082) (← links)
- A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
- (Q3360009) (← links)
- Corrigendum for "Truth in a logic of formal inconsistency: How classical can it get?" (Q5877714) (← links)
