In this paper we further investigate the problem of finding nadir criterion values (minimum criterion values over the nondominated set) in multiple objective linear programming. Although easy to ...
Pole Przemyslaw "Psyho" Debiak won the prestigious AWTF Heuristic programming tournament. He beat not only the human participants, but also AI. He is the only human to have succeeded. A Polish ...
The weighted maximal planar graph (WMPG) is practically important in the laying out of facilities in modern manufacturing environments. Given a weighted complete graph, the WMPG seeks to find a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback