Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.06.024
+Normal rank
@@ Property / OpenAlex ID @@
+W1963598301
@@ Property / OpenAlex ID: W1963598301 / rank @@
+Normal rank
@@ Property / cites work @@
+MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
+Normal rank
@@ Property / cites work @@
+A review of interactive methods for multiobjective integer and mixed-integer programming
+Normal rank
@@ Property / cites work @@
+Solving efficiently the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4424322
@@ Property / cites work: Q4424322 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
+Normal rank
@@ Property / cites work @@
+Q4451071
@@ Property / cites work: Q4451071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723294
@@ Property / cites work: Q2723294 / rank @@
+Normal rank
@@ Property / cites work @@
+A discussion of scalarization techniques for multiple objective integer programming
+Normal rank
@@ Property / cites work @@
+Approximating Multiobjective Knapsack Problems
@@ Property / cites work: Approximating Multiobjective Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
+Normal rank
@@ Property / cites work @@
+A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
+Normal rank
@@ Property / cites work @@
+A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
+Normal rank
@@ Property / cites work @@
+On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
+Normal rank
@@ Property / cites work @@
+Q4424311
@@ Property / cites work: Q4424311 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945108
@@ Property / cites work: Q4945108 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+An Automatic Method of Solving Discrete Programming Problems
+Normal rank
@@ Property / cites work @@
+An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
+Normal rank
@@ Property / cites work @@
+Evolutionary Computation in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Hybrid population-based algorithms for the bi-objective quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Heuristic algorithms for the multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for mixed zero-one multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
+Normal rank
@@ Property / cites work @@
+An interactive heuristic method for multi-objective combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
+Normal rank
@@ Property / cites work @@
+Q4817401
@@ Property / cites work: Q4817401 / rank @@
+Normal rank