Applications of the parametric programming procedure
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- A Lagrangean relaxation method for the constrained assignment problem
- A Lagrangian treatment of certain nonlinear clustering problems
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Computational complexity of parametric linear programming
- Finding all efficient extreme points for multiple objective linear programs
- Identifying Efficient Vectors: Some Theory and Computational Results
- Linear multiobjective programming
- Making progress during a stall in the simplex algorithm
- Network flow problems with one side constraint: A comparison of three solution methods
- Parametric linear programming and anti-cycling pivoting rules
- The Average number of pivot steps required by the Simplex-Method is polynomial
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The constrained shortest path problem
Cited in
(4)- scientific article; zbMATH DE number 1471810 (Why is no real title available?)
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- Parametric programming and the primal-dual algorithm
- scientific article; zbMATH DE number 5168299 (Why is no real title available?)
This page was built for publication: Applications of the parametric programming procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179007)