A combinatorial algorithm for inverse continuous quadratic knapsack problem
From MaRDI portal
Cites work
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A new polynomial-time algorithm for linear programming
- A Selection Problem of Shared Fixed Costs and Network Flows
- Algorithms for the solution of quadratic knapsack problems
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- An algorithm for inverse minimum spanning tree problem
- An O(n) algorithm for quadratic knapsack problems
- Applications of Quadratic Programming
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Combinatorial algorithms for inverse network flow problems
- Complexity of some inverse shortest path lengths problems
- scientific article; zbMATH DE number 1086909 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- Inverse p-median problems with variable edge lengths
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Inverse Optimization
- Inverse optimization for linearly constrained convex separable programming problems
- Inverse optimization for the recovery of constraint parameters
- Inverse polynomial optimization
- Inverse quadratic programming problem with \(l_1\) norm measure
- Notes on inverse bin-packing problems
- On an instance of the inverse shortest paths problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- On some inverse 1-center location problems
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- On the continuous quadratic knapsack problem
- Partial inverse assignment problems under \(l_{1}\) norm
- Solving inverse spanning tree problems through network flow techniques
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- The quadratic knapsack problem -- a survey
- The symmetric quadratic knapsack problem: approximation and scheduling applications
This page was built for publication: A combinatorial algorithm for inverse continuous quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314149)
