An algorithm for solving a structured class of linear programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4143769
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n log n)-algorithm for solving a special class of linear programs
- An efficient algorithm for solving a special class of LP's
- A linear-time algorithm for solving continuous maximin knapsack problems
Cites work
Cited in
(15)- scientific article; zbMATH DE number 3987051 (Why is no real title available?)
- The construction of a solution of the alternative linear programming problem
- ALPO: Another Linear Program Optimizer
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- A strictly improving linear programming Phase I algorithm
- An O(n log n)-algorithm for solving a special class of linear programs
- Un algorithme pour la résolution du programme linéaire général
- Near-Regular Structure Discovery Using Linear Programming
- An algorithm for solving mathematical programming problems
- scientific article; zbMATH DE number 1131737 (Why is no real title available?)
- scientific article; zbMATH DE number 4068606 (Why is no real title available?)
- scientific article; zbMATH DE number 4211802 (Why is no real title available?)
- An efficient algorithm for solving a special class of LP's
- On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem
- scientific article; zbMATH DE number 5182668 (Why is no real title available?)
This page was built for publication: An algorithm for solving a structured class of linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078069)