Search Results - subject:"NP-Complete"

Which rectangle sets have perfect packings?

Braam, Florian; van den Berg, Daan - In: Operations Research Perspectives 9 (2022), pp. 1-9

In the perfect rectangle packing problem, a set of rectangular items have to be placed inside a rectangular container without overlap or empty space. In this paper, we generate a large number of random instances and decide them all with an exact solving algorithm. Both an instance's solution...

Persistent link: https://www.econbiz.de/10015455336

Which rectangle sets have perfect packings?

Braam, Florian; Berg, Daan van den - In: Operations research perspectives 9 (2022), pp. 1-9

Persistent link: https://www.econbiz.de/10012880268

Optimizing the resource consumption of Blockchain technology in business systems

Juričić, Vedran; Radošević, Matea; Fuzul, Ena - In: Business systems research : a system view accross … 11 (2020) 3, pp. 78-92

research is to provide different insights into blockchain technology and to propose NP-complete problems as a suitable … cryptocurrencies but focusing on incorporating NP-complete problems as a secondary, more useful option. Results Using the properties of … NP-complete problems, it is possible to solve various problems in different areas, such as science, biology, medicine and …

Persistent link: https://www.econbiz.de/10012414439

Optimizing the resource consumption of Blockchain technology in business systems

Juričić, Vedran; Radošević, Matea; Fuzul, Ena - In: Business Systems Research (BSR) 11 (2020) 3, pp. 78-92

Persistent link: https://www.econbiz.de/10015408743

An optimization framework for analyzing dual-donor organ exchange

Le, Tuan; Stauffer, Jon M.; Shetty, Bala; … - In: Production and operations management : the flagship … 32 (2023) 3, pp. 740-761

Persistent link: https://www.econbiz.de/10014266151

Numerical experiments with LP formulations of the maximum clique problem

Kardos, Dóra; Patassy, Patrik; Szabó, Sándor; … - In: Central European journal of operations research 30 (2022) 4, pp. 1353-1367

Persistent link: https://www.econbiz.de/10013445722

Cseh, Ágnes; Huang, Chien-chung; Kavitha, Telikepalli - 2017

We are given a bipartite graph G = (A B;E) where each vertex has a preference list ranking its neighbors: in particular, every a A ranks its neighbors in a strict order of preference, whereas the preference list of any b B may contain ties. A matching M is popular if there is no matching M' such...

Persistent link: https://www.econbiz.de/10011757166

Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli - 2017

Persistent link: https://www.econbiz.de/10011944920

A clique search problem and its application to machine scheduling

Szabó, Sándor - In: Operations research forum 2 (2021) 4, pp. 1-12

Persistent link: https://www.econbiz.de/10012794437

NP-completeness of cell formation problem with grouping efficacy objective

Batsyn, Mikhail; Batsyna, Ekaterina K.; Bychkov, Ilya S. - In: International journal of production research 58 (2020) 20, pp. 6159-6169

Persistent link: https://www.econbiz.de/10012315386