Determining the optimal coalition configuration in CCF is NP-hard, and the stability of such a configuration relies on the cost sharing rule within each group. We thus propose a heuristic algorithm for CCF based on augmented greedy selections, along with a cost sharing rule satisfying certain stability properties. Simulation results show that our approximate algorithm generates fairly good solutions compared to the optimal results, and is greatly superior to a simpler distributed approach. Furthermore, our algorithm's performance is enhanced when items are complementary or strongly substitutable, especially in settings when the prices decrease either rapidly or slowly with the quantities. Evaluations of the sellers' revenue under CCF demonstrate that sellers should offer a more gradually decreasing price-quantity curve for complementary or strongly substitutable items, and a more abruptly decreasing curve for weakly substitutable items. In addition, sellers may benefit from greater sales generated by simpler price-quantity curves with fewer steps.