Naval Research Logistics Quarterly · 1979 · 118 citations · 5 references
BusinessComputer ScienceAlgorithmsOptimizationTransportationCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingLinear ProgrammingMulti-objective OptimizationTransportation ProblemsConvex SetsEnumerative AlgorithmsMulti-objective Combinatorial Optimization
Abstract An algorithm is presented by which the set of all efficient solutions for a linear multiple‐objective transportation problem can be enumerated. First the algorithm determines an initial efficient basic solution. In a second step all efficient basic solutions are enumerated. Finally, the set of all efficient solutions is constructed as a union of a minimal number of convex sets of efficient solutions. The algorithm is illustrated by a numerical example.
5
E. M. L. Beale, Hans Paul Kunzi, Wilhelm Krelle et al. · Journal of the Royal Statistical Society Series A (General) · 1968 · 707 citations
Solving Bicriterion Mathematical Programs
Arthur M. Geoffrion · Operations Research · 1967 · 277 citations