Pages that link to "Item:Q1694819"
From MaRDI portal
The following pages link to Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819):
Displayed 15 items.
- Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (Q2239950) (← links)
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem (Q2242191) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry (Q2312332) (← links)
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment (Q2664445) (← links)
- A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution (Q2672147) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model (Q6106565) (← links)
- Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic (Q6167880) (← links)