Search Results - subject:"NP-Hard problem"

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

Van Bevern, René; Skachkov, Daniel A. - In: Operations research letters : a journal of INFORMS … 52 (2024), pp. 1-3

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

A novel algorithm for clearing financial obligations between companies : an application within the Romanian Ministry of economy

Gavrila, Lucian-Ionut; Popa, Alexandru - In: Algorithmic finance 9 (2021) 1/2, pp. 49-60

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

An improved balanced algorithm for the subset-sum problem

Curtis, V. V.; Sanches, C. A. A. - In: European journal of operational research : EJOR 275 (2019) 2, pp. 460-466

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

A note on the indeterminacy and arbitrariness of pena’s method of construction of synthetic indicators

Mishra, SK - Volkswirtschaftliche Fakultät, … - 2012

In this paper we demonstrate that Pena’s method of construction of a synthetic indicator is very sensitive to the order in which the constituent variables (whose linear aggregation yields the synthetic indicator) are arranged. Since m number of constituent variables may be arranged in...

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

A Competitive Genetic Algorithm for Single Row Facility Layout

Kothari, Uma; Ghosh, Diptesh - eSocialSciences - 2012

The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to …

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

Variable neighborhood search variants for min-power symmetric connectivity problem

Erzin, A. I.; Mladenovic, Nenad; Plotnikov, R. V. - In: Computers & operations research : and their … 78 (2017), pp. 557-563

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

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs : few machines, small looseness, and small slack

Van Bevern, René; Niedermeier, Rolf; Suchý, Ondřej - In: Journal of scheduling 20 (2017) 3, pp. 255-265

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

Delinquent Networks

Ballester, Coralio; Calvó-Armengol, Antoni; Zenou, Yves - Institute for the Study of Labor (IZA) - 2009

14 Keywords: social networks, delinquency decision, key group, NP-hard problem, crime policies Corresponding … “key link” policy, in addition to the “key player” policy; (iv) it shows that finding a “key group” is an NP-hard problem …

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

Delinquent networks

Ballester, Coralio; Calvó-Armengol, Antoni; Zenou, Yves - 2009

Delinquents are embedded in a network of relationships. Social ties among delinquents are modeled by means of a graph where delinquents compete for a booty and benefit from local interactions with their neighbors. Each delinquent decides in a non-cooperative way how much delinquency effort he...

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

Delinquent Networks

Ballester, Coralio; Calvo-Armengol, Antoni; Zenou, Yves - 2009

Delinquents are embedded in a network of relationships. Social ties among delinquents are modelled by means of a graph where delinquents compete for a booty and benefit from local interactions with their neighbors. Each delinquent decides in a non cooperative way how much delinquency effort he...

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