Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...
Tech Xplore on MSN
Firefly-inspired algorithm tackles resource allocation problem
Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of ...
This is a preview. Log in through your library . Abstract The hyperbolic (or fractional) linear programming problem with only one aggregate constraint is solved by a simple and extremely efficient ...
On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...
This is a preview. Log in through your library . Abstract The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback