Pages that link to "Item:Q954053"
From MaRDI portal
The following pages link to A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053):
Displayed 14 items.
- A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning (Q320730) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- A cross entropy approach to design of reliable networks (Q1042175) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms (Q1652475) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- A review of decentralized optimization focused on information flows of decomposition algorithms (Q6164389) (← links)