Commentary—Progress in Linear Programming
From MaRDI portal
Recommendations
- Linear programming: recent advances
- Advances in linear and nonlinear programming
- Advances in optimization and linear programming
- scientific article; zbMATH DE number 4049377
- scientific article; zbMATH DE number 3254598
- scientific article; zbMATH DE number 1021641
- scientific article; zbMATH DE number 4119923
- Developments in linear and integer programming
- Some recent advances and new directions in linear programming
- scientific article; zbMATH DE number 757651
Cited in
(20)- An efficient simplex type algorithm for sparse and dense linear programs.
- Interior point methods 25 years later
- A primal heuristic for optimizing the topology of gas networks based on dual information
- A New Algorithm To Solve Vehicle Routing Problems (VRPs)
- Combined projected gradient algorithm for linear programming
- Successive Linear Programming at Exxon
- Presolving in linear programming
- Advances in linear and nonlinear programming
- The role of the augmented system in interior point methods
- scientific article; zbMATH DE number 3997042 (Why is no real title available?)
- scientific article; zbMATH DE number 1021641 (Why is no real title available?)
- Multiple centrality corrections in a primal-dual method for linear programming
- Interior point methods in the year 2025
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- A linear programming primer: from Fourier to Karmarkar
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- A barrier method for dynamic Leontief-type linear programs
- An efficient approach to updating simplex multipliers in the simplex algorithm
- Pivot versus interior point methods: Pros and cons
This page was built for publication: Commentary—Progress in Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291493)
