Dürer's problem: edge-unfolding convex polyhedra

Prove that every convex polyhedron can be cut along its edges and unfolded flat in one piece without overlap, or find one that cannot.