Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
From MaRDI portal
Recommendations
- Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- scientific article; zbMATH DE number 1149800
- scientific article; zbMATH DE number 1830735
- Approximating multiobjective knapsack problems
- Evolutionary algorithms for knapsack problems
- scientific article; zbMATH DE number 1617337
Cites work
- scientific article; zbMATH DE number 1975093 (Why is no real title available?)
- scientific article; zbMATH DE number 1975101 (Why is no real title available?)
- scientific article; zbMATH DE number 2046100 (Why is no real title available?)
- scientific article; zbMATH DE number 2102225 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A discussion of scalarization techniques for multiple objective integer programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- An Automatic Method of Solving Discrete Programming Problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An interactive heuristic method for multi-objective combinatorial optimization
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Approximating multiobjective knapsack problems
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Evolutionary Computation in Combinatorial Optimization
- Heuristic algorithms for the multiple knapsack problem
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multi-objective optimization using evolutionary algorithms
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
Cited in
(24)- The multiobjective multidimensional knapsack problem: a survey and a new approach
- Bridging game theory and the knapsack problem: a theoretical formulation
- A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Multi-directional local search
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Multi-objective optimization using statistical models
- Approximate and exact merging of knapsack constraints with cover inequalities
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Branch-and-bound and objective branching with three or more objectives
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- Multi-objective branch and bound
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- scientific article; zbMATH DE number 1703851 (Why is no real title available?)
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
This page was built for publication: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043327)
