Pages that link to "Item:Q1042187"

The following pages link to Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187):

Displaying 28 items.

• A new Bayesian approach to multi-response surface optimization integrating loss function with posterior probability (Q320913) (← links)
• Evolutionary algorithms for supply chain management (Q324297) (← links)
• A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs (Q521579) (← links)
• A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times (Q709158) (← links)
• Application of chaos-based chaotic invasive weed optimization techniques for environmental OPF problems in the power system (Q728148) (← links)
• Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
• Architecture of manufacturing scheduling systems: literature review and an integrated proposal (Q976436) (← links)
• A matheuristic approach for the design of multiproduct batch plants with parallel production lines (Q1631517) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
• An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
• Bacterial foraging-tabu search metaheuristics for identification of nonlinear friction model (Q1760596) (← links)
• A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times (Q1761176) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• A robust desirability function method for multi-response surface optimization considering model uncertainty (Q1926843) (← links)
• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
• An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines (Q2242193) (← links)
• A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
• A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems (Q2453178) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach (Q6060690) (← links)
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)