Parametric Solution for Linear Bicriteria Knapsack Models

DOI10.1287/mnsc.42.11.1565zbMath0879.90162OpenAlexW2086459924MaRDI QIDQ4363722

Moshe Eben-Chaime

Publication date: 25 January 1998

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.42.11.1565

zbMATH Keywords

knapsack problemparametric solutiontwo linearly weighted, objective criteria

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Related Items (16)

An FPTAS for the parametric knapsack problem ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ Unnamed Item ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ Approximation schemes for the parametric knapsack problem ⋮ A survey of recent developments in multiobjective optimization ⋮ An efficient algorithm to allocate shelf space ⋮ An FPTAS for the knapsack problem with parametric weights ⋮ A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem ⋮ An approximation algorithm for a general class of multi-parametric optimization problems ⋮ A bicriteria knapsack program for planning remediation of contaminated lightstation sites

This page was built for publication: Parametric Solution for Linear Bicriteria Knapsack Models