Operations Research Letters · 1995 · 106 citations · 19 references
Natural SciencesMathematicsOptimizationBranch And BoundCombinatorial OptimizationConstrained OptimizationInteger ProgrammingNonlinear ProgrammingOptimization TheoryKnapsack ApproximationKnapsack ProblemsScheduling Problems
19
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Éva Tardos · Operations Research · 1986 · 485 citations