Parametric Solution for Linear Bicriteria Knapsack Models
From MaRDI portal
Recommendations
- Study of the linear parametrization of criteria in the bicriteria knapsack problem
- Approximation schemes for the parametric knapsack problem
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Parameterized approximation scheme for the multiple knapsack problem
- Parameterized approximation scheme for the multiple knapsack problem
- Knapsack problems: a parameterized point of view
- An algorithm for solving bicriterial linear programming problems with parametrical coefficients in the objective functions
- Exact solution of a class of nonlinear knapsack problems
- Parametric Solution of Bicriterion Linear Fractional Programs
- An integer linear optimization model to the compartmentalized knapsack problem
Cited in
(19)- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- Finding representations for an unconstrained bi-objective combinatorial optimization problem
- On weighting two criteria with a parameter in combinatorial optimization problems
- An approximation algorithm for a general class of multi-parametric optimization problems
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for the parametric knapsack problem
- A survey of recent developments in multiobjective optimization
- Hybrid approaches for the two-scenario max-min knapsack problem
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- Approximation schemes for the parametric knapsack problem
- Study of the linear parametrization of criteria in the bicriteria knapsack problem
- An efficient algorithm to allocate shelf space
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- A stronger lower bound on parametric minimum spanning trees
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- A stronger lower bound on parametric minimum spanning trees
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
This page was built for publication: Parametric Solution for Linear Bicriteria Knapsack Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363722)
