The following pages link to (Q4387182):
Displaying 19 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems (Q733985) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (Q1383928) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem (Q3354470) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
