Pages that link to "Item:Q4198334"

The following pages link to A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem (Q4198334):

Displaying 50 items.

• 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 investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
• Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← 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)
• A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
• A trust branching path heuristic for zero-one programming (Q1014935) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
• Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
• A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• Decentralization of responsibility for site decontamination projects: A budget allocation approach (Q1390197) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
• Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
• Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
• Novel binary differential evolution algorithm for knapsack problems (Q2053861) (← links)
• Gompertz PSO variants for knapsack and multi-knapsack problems (Q2076716) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem (Q2242191) (← links)
• An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← 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)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
• Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
• Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment (Q2666690) (← links)
• A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem (Q2798113) (← links)
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)