Search Results - subject:"analysis of algorithms"

Machine speed scaling by adapting methods for convex optimization with submodular constraints

Shioura, Akiyoshi; Shakhlevich, Natasha; Strusevich, … - In: INFORMS journal on computing : JOC 29 (2017) 4, pp. 724-736

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

New benchmark instances for the capacitated vehicle routing problem

Uchoa, Eduardo; Pecin, Diego; Pessoa, Artur; Poggi, Marcus - In: European journal of operational research : EJOR 257 (2017) 3, pp. 845-858

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

Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines

Shioura, Akiyoshi; Shakhlevich, Natasha; Strusevich, … - In: INFORMS journal on computing : JOC 28 (2016) 1, pp. 148-161

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

Improved and generalized upper bounds on the complexity of policy iteration

Scherrer, Bruno - In: Mathematics of operations research 41 (2016) 3, pp. 758-774

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

Constrained resource assignments : fast algorithms and applications in wireless networks

Berger, André; Gross, James; Harks, Tobias; Tenbusch, Simon - In: Management science : journal of the Institute for … 62 (2016) 7, pp. 2070-2089

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

An adaptive flex-deluge approach to university exam timetabling

Burke, Edmund K.; Bykov, Yuri - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 781-794

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

The truncated geometric election algorithm: Duration of the election

Louchard, Guy; Ward, Mark Daniel - In: Statistics & Probability Letters 101 (2015) C, pp. 40-48

The present paper makes three distinct improvements over an earlier investigation of Kalpathy and Ward. We analyze the length of the entire election process (not just one participant’s duration), for a randomized election algorithm, with a truncated geometric number of survivors in each round....

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

Capacity constraints across nests in assortment optimization under the nested logit model

Feldman, Jacob; Topaloğlu, Hüseyin - In: Operations research 63 (2015) 4, pp. 812-822

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

Priest : an interactive decision support tool to estimate priorities from pairwise comparison judgements

Siraj, Sajid; Mikhailov, Ludmil; Keane, John A. - In: International transactions in operational research : … 22 (2015) 2, pp. 217-235

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

A network structural approach to the link prediction problem

Lee, Chungmok; Pham, Minh; Jeong, Myong K.; Kim, Dohyun; … - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 249-267

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