Determining the optimal solution (OS) set of interval linear fractional programming (ILFP) models is generally an NP-hard problem. Few methods have been proposed in this field which have only been ...
This is a preview. Log in through your library . Abstract We consider the feasibility problem OPP (orthogonal packing problem) in higher-dimensional orthogonal packing: given a set of d-dimensional (d ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback