This paper is devoted to the search for Choquet-optimal solutions in multicriteria combinatorial optimization with application to spanning tree problems and knapsack problems. After recalling basic notions concerning the use of Choquet integrals for preference aggregation, we present a condition (named preference for interior points) that characterizes preferences favoring well-balanced solutions, a natural attitude in multicriteria optimization. When using a Choquet integral as preference model, this condition amounts to choosing a submodular (resp. supermodular) capacity when criteria have to be minimized (resp. maximized). Under this assumption, we investigate the determination of Choquet-optimal solutions in the multicriteria spanning tree problem and the multicriteria 0-1 knapsack problem. For both problems, we introduce a linear bound for the Choquet integral, computable in polynomial time, and propose a branch and bound procedure using this bound. We provide numerical experiments that show the actual efficiency of the algorithms on various instances of different sizes.