Optimization with additional variables and constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- Linear Programming in Linear Time When the Dimension Is Fixed
- On Linear Characterizations of Combinatorial Optimization Problems
- Polynomial algorithms in linear programming
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The inverse-parametric knapsack problem
- The maximum concurrent flow problem
- The quickest flow problem
- Using separation algorithms in fixed dimension
This page was built for publication: Optimization with additional variables and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779712)