Pages that link to "Item:Q1273651"

The following pages link to A genetic algorithm for the multidimensional knapsack problem (Q1273651):

Displaying 50 items.

• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
• Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking (Q342261) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
• A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation (Q424789) (← links)
• Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
• Geometricity of genetic operators for real-coded representation (Q482440) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
• Sampled fictitious play for approximate dynamic programming (Q547121) (← links)
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
• A genetic algorithm with fuzzy crossover operator and probability (Q666428) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
• The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study (Q833551) (← links)
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem (Q883311) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• An ant colony optimization approach for binary knapsack problem under fuzziness (Q907543) (← links)
• Scatter search for the 0-1 multidimensional knapsack problem (Q928688) (← links)
• A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
• A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
• NeuroGenetic approach for combinatorial optimization: an exploratory analysis (Q970182) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
• Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
• A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
• A trust branching path heuristic for zero-one programming (Q1014935) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
• Two genetic algorithms to solve a layout problem in the fashion industry (Q1420438) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
• A framework for the description of evolutionary algorithms (Q1584807) (← links)
• An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (Q1616250) (← links)
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem (Q1644042) (← links)
• A genetic algorithm to solve the multidimensional knapsack problem (Q1649280) (← links)