Algorithms for solving the single-sink fixed-charge transportation problem

References

Page 1

	Year	Citations
Knapsack Problems: Algorithms and Computer Implementations David Connolly, Silvano Martello, Paolo Toth Journal of the Operational Research Society	1991	3.2K
Knapsack problems, algorithms and computer implementations Jeroen De Kort European Journal of Operational Research Mathematical ProgrammingEngineeringInteger OptimizationCombinatorial ProblemDiscrete Optimization	1991	1.4K
An Algorithm for Large Zero-One Knapsack Problems Egon Balas, Eitan Zemel Operations Research Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	1980	469
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem Silvano Martello, David Pisinger, Paolo Toth Management Science Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	1999	392
A Minimal Algorithm for the 0-1 Knapsack Problem David Pisinger Operations Research Mathematical ProgrammingEngineeringComputational ComplexityDiscrete OptimizationOperations Research	1997	244
An upper bound for the zero-one knapsack problem and a branch and bound algorithm Silvano Martello, Paolo Toth European Journal of Operational Research Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringInteger OptimizationOptimization Problem	1977	143
A Branch-and-Bound Method for the Fixed Charge Transportation Problem Udatta S. Palekar, Mark H. Karwan, Stanley Zionts Management Science Mathematical ProgrammingNumerical AnalysisTransport Network AnalysisBranch-and-bound AlgorithmEngineering	1990	141
A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem Jeff Kennington, Ed Unger Management Science Mathematical ProgrammingFixed-charge Transportation ProblemElectrical EngineeringBranch-and-bound AlgorithmEngineering	1976	106
The concave cost supply problem Satyaveer S. Chauhan, Jean‐Marie Proth European Journal of Operational Research Mathematical ProgrammingEconomicsCost AllocationEngineeringCost Issue	2003	59
Heuristics for the 0-1 Min-Knapsack Problem János Csirik, J. B. G. Frenk, Martine Labbé, RePub (Erasmus University, Rotterdam)	1991	56

Page 1