Algorithms: find optimal solution for linear cutting

I need an optimization algorithm made in java. I have some bars and I need to cut them into smaller pieces of specified sizes with minimal losses. Input data: - A text file containing sizes of existing bars (mm); - A text file containing sizes of needed bars (mm); - An ini file containing cutting width (mm; default value=4 mm (when cutting, 4 mm is lost on each cut)); Result: A text file containing the list of bars to cut. Each of them must be followed by a list containing sizes of pieces to cut from that bar. Example: [login to view URL] (I have 2 bars x 3m length; 1 bar x 2,5 m; 1 bar x 1m) 3000 3000 2500 1000 [login to view URL] ( I need a piece of 75 cm, 2 pieces x 20 cm, 1 piece x 10 cm, 1 piece 14 cm) 750 200 200 100 140 [login to view URL] (must cut 1 x 750 mm + 1 x 100 + 1 x 140 from the existing bar with length 1000 mm; 2 x 200 mm from the bar with length of 2500 mm) 1000 750 100 140 2500 200 200 I am a programmer too, but now I'm working at a big project an have no time to think about optimal cut solution. The solution must be optimal or at least very close to the optimal solution. Code must be written in Java (I need source code), without any additional library. Code must be written by you, with no copyright infringement.