The inverse-parametric knapsack problem-Reference-Cited by-同舟云学术

The inverse-parametric knapsack problem

Published:1995-06 Issue:2 Volume:83 Page:376-393
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Burkard Rainer E.,Pferschy Ulrich

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference17 articles.

1. The quickest disjoint flow problem;Burkard,1991

2. The quickest flow problem;Burkard;Zeitschrift für Operations Research,1993

3. Complexity of some parametric integer and network programming problems;Carstensen;Mathematical Programming,1983

4. The quickest path problem;Chen;Computers & Operations Research,1990

5. Approximation algorithms for combinatorial fractional programming problems;Hashizume;Mathematical Programming,1987

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An FPTAS for the knapsack problem with parametric weights;Operations Research Letters;2018-09

2. Tolerance analysis for 0–1 knapsack problems;European Journal of Operational Research;2017-05

3. Approximation schemes for the parametric knapsack problem;Information Processing Letters;2017-04

4. Optimization with additional variables and constraints;Operations Research Letters;2005-05

5. An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization;Operations Research/Computer Science Interfaces Series;1998