Pages that link to "Item:Q976023"

The following pages link to Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023):

Displaying 43 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• Kernel search: an application to the index tracking problem (Q439324) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• An efficient heuristic algorithm for the alternative-fuel station location problem (Q1744496) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← 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)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• The multi-visit team orienteering problem with precedence constraints (Q2282540) (← links)
• A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry (Q2312332) (← links)
• Mixed integer linear programming for feature selection in support vector machine (Q2414473) (← links)
• Index tracking with fixed and variable transaction costs (Q2439491) (← links)
• Twenty years of linear programming based portfolio optimization (Q2514724) (← 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)
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms (Q2669729) (← 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)
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← 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)
• The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules (Q6106592) (← links)
• Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
• Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic (Q6167880) (← links)