Pages that link to "Item:Q1595283"

The following pages link to Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283):

Displaying 36 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• Multi-directional local search (Q339654) (← links)
• Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
• Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia (Q857313) (← links)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
• Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
• A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
• Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation (Q1642066) (← links)
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem (Q1644042) (← links)
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
• Objective space division-based hybrid evolutionary algorithm for handing overlapping solutions in combinatorial problems (Q2130396) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• A multi-objective model for environmental investment decision making (Q2384603) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
• An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search (Q2567890) (← links)
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
• The influence of the fitness evaluation method on the performance of multiobjective search algorithms (Q2572858) (← links)
• Multi-objective tabu search using a multinomial probability mass function (Q2572860) (← links)
• A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
• A hybrid meta-heuristic for multi-objective optimization: MOSATS (Q2643719) (← links)
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 (Q4546065) (← links)
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) (← links)
• Parallel implementation of an exact two-phase method for the biobjective knapsack problem (Q6658451) (← links)