Search Results - subject:"computational complexity"

Crane scheduling in railway yards : an analysis of computational complexity

Stephan, Konrad; Boysen, Nils - In: Journal of scheduling 20 (2017) 5, pp. 507-526

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

Optimal partisan districting on planar geographies

Fleiner, Balázs; Nagy, Balázs Vince; Tasnádi, Attila - In: Central European journal of operations research : CEJOR … 25 (2017) 4, pp. 879-888

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

Scheduling reclaimers serving a stock pad at a coal terminal

Kalinowski, Thomas; Kapoor, Reena; Savelsbergh, Martin W. P. - In: Journal of scheduling 20 (2017) 1, pp. 85-101

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

Minimizing the number of stations and station activation costs for a production line

Kovalev, Sergey; Delorme, Xavier; Dolgui, Alexandre; … - In: Computers & operations research : and their … 79 (2017), pp. 131-139

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

A Note on the Shapley Value for Characteristic Functions on Bipartitions

Muns, Sander - 2011

coalition players. The computational complexity grows linearly in the number of players, which contrasts with the usual …

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

Matching with Couples: a Multidisciplinary Survey

Biró, Péter; Klijn, Flip - 2011

This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results. Then, we review recent contributions to a complex and representative...

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