Search Results - subject:"complexity analysis"

Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis

Murota, Kazuo; Shioura, Akiyoshi; Yang, Zaifu - Department of Economics and Related Studies, University … - 2014

We examine an auction model where there are many different goods, each good has multiple units, and bidders have gross substitutes valuations over the goods. We analyze the number of iterations in iterative auction algorithms for the model based on the theory of discrete convex analysis. By...

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

Improved quick hypervolume algorithm

Jaszkiewicz, Andrzej - In: Computers & operations research : and their … 90 (2018), pp. 72-83

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

Optimal workforce assignment to operations of a paced assembly line

Dolgui, Alexandre; Kovalev, Sergey; Kovalyov, Mikhail Y.; … - In: European journal of operational research : EJOR 264 (2018) 1, pp. 200-211

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

Analysis of FPTASes for the multi-objective shortest path problem

Breugem, Thomas; Dollevoet, Twan; Heuvel, Wilco van den - In: Computers & operations research : and their … 78 (2017), pp. 44-58

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

Proactive assessment of basic complexity in manual assembly : development of a tool to predict and control operator-induced quality errors

Falck, Ann-Christine; Örtengren, Roland; Rosenqvist, Mikael - In: International journal of production research 55 (2017) 15/16, pp. 4248-4260

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

A strongly polynomial contraction-expansion algorithm for network flow problems

Gauthier, Jean Bertrand; Desrosiers, Jacques; … - In: Computers & operations research : and their … 84 (2017), pp. 16-32

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

The two-level economic lot sizing problem with perishable items

Önal, Mehmet - In: Operations research letters 44 (2016) 3, pp. 403-408

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

A complexity analysis and an algorithmic approach to student sectioning in existing timetables

Dostert, M.; Politz, A.; Schmitz, Heinz - In: Journal of scheduling 19 (2016) 3, pp. 285-293

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

Finding optimal tour schedules on transportation paths under extended time window constraints

Bock, Stefan - In: Journal of scheduling 19 (2016) 5, pp. 527-546

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

Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming

Gromicho, J.A.S.; Hoorn, J.J. van; Timmer, G.T. - Faculteit der Economische Wetenschappen en … - 2009

not obtained for free in the case of the job-shop scheduling problem, and by performing a complexity analysis of the … room for improvement in the complexity analysis (we observe the generation of a number of solutions per state for the …

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