Pages that link to "Item:Q1273651"
From MaRDI portal
The following pages link to A genetic algorithm for the multidimensional knapsack problem (Q1273651):
Displayed 43 items.
- 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)
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study (Q833551) (← 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)
- 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)
- 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)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints (Q1781556) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem (Q2427438) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- An Optimal Strategy for the Constrained Cycle Cover Problem (Q2741265) (← links)
- Values Suggestion in Mixed Integer Programming by Machine Learning Algorithm (Q2741268) (← links)
- Intelligent water drops algorithm (Q3526263) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- A mathematical model for selecting mixed models with due dates (Q4460043) (← links)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)