scientific article; zbMATH DE number 1149800
From MaRDI portal
Publication:4387182
Recommendations
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- A branch-and-bound algorithm for hard multiple knapsack problems
- scientific article; zbMATH DE number 1830735
- Approximating multiobjective knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A branch-and-bound algorithm for the quadratic multiple knapsack problem
- Optimal strategy for solving a special case of the knapsack problem by the branch and bound method
Cited in
(21)- Labeling algorithms for multiple objective integer knapsack problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- An interactive heuristic method for multi-objective combinatorial optimization
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Multi-objective branch and bound
- B{\&}B method for discrete partial order optimization
- A survey of recent developments in multiobjective optimization
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- Branch-and-bound and objective branching with three or more objectives
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem
- New perspectives on multi-objective knapsack problems
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Augmenting bi-objective branch and bound by scalarization-based information
- On improvements of multi-objective branch and bound
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387182)
