The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
From MaRDI portal
Publication:2445845
DOI10.1016/j.disopt.2013.03.001zbMath1284.90067OpenAlexW2003303695MaRDI QIDQ2445845
Yves De Smet, Julien Roland, José Rui Figueira
Publication date: 15 April 2014
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.03.001
Related Items
The inverse connected \(p\)-median problem on block graphs under various cost functions, The 0–1 inverse maximum independent set problem on forests and unicyclic graphs, Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm, Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse integer programming
- A new polynomial-time algorithm for linear programming
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- On an instance of the inverse shortest paths problem
- A minimal algorithm for the multiple-choice knapsack problem
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Two general methods for inverse optimization problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- Inverse Optimization
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Statistical Analysis of Computational Tests of Algorithms and Heuristics
- Combinatorial algorithms for inverse network flow problems
- The Mixed Integer Linear Bilevel Programming Problem
- Algorithmic Applications in Management
