In this paper we formulate fixed-charge problems with polynomials. Using polynomial formulations we show structural similarity between different kinds of linear and fixed charge formulations. We also show the benefits of applying polynomial formulation for finding an approximate solution for...

Eilon and Christofides (E & C), in their paper on "The Loading Problem" [Eilon, S., N. Christofides. 1971. The loading problem. Management Sci. 17(5, January) 259-268.], suggest a solution using a heuristic algorithm. In this note we would like to present a simpler heuristic algorithm which is...

In this paper we present a new approximation for computing lower bound for the fixed charge transportation problem (FCTP). The lower bounds thus generated delivered 87% optimal solutions for 56 randomly generated small, up to 6×10 in size, problems in an experimental design. For somewhat...