The following pages link to (Q4778556):
Displaying 17 items.
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives (Q502471) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints (Q864782) (← links)
- Bicriteria approximation algorithms for scheduling problems with communications delays (Q880503) (← 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)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- The packing while traveling problem (Q1751654) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- The multi-Handler knapsack problem under uncertainty (Q2514753) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- (Q4387182) (← links)
- (Q4811939) (← links)
- (Q4999247) (← links)
- Scheduling parallel dedicated machines with the speeding‐up resource (Q5393022) (← links)
