Pages that link to "Item:Q1027579"

The following pages link to Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579):

Displaying 16 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
• A new effective dynamic program for an investment optimization problem (Q505320) (← links)
• Approximation schemes for the parametric knapsack problem (Q506160) (← links)
• Covers and approximations in multiobjective optimization (Q513168) (← links)
• The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
• Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)
• Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)