A Dynamic Programming Approach for the Decentralized Control of Discrete Optimizers with Quadratic Utilities and Shared Constraint

Συγγραφείς: Carli, Raffaele, Dotoli, Mariagrazia

Πηγή: 2020 28th Mediterranean Conference on Control and Automation (MED) Control and Automation (MED), 2020 28th Mediterranean Conference on. :611-616 Sep, 2020

Relation: 2020 28th Mediterranean Conference on Control and Automation (MED)

Scheduling with step learning and job rejection

Συγγραφείς: Song, Jiaxin^{Aff1, Aff2}, Miao, Cuixia^{Aff1, IDs1235102400887w_cor1}, Kong, Fanyu

Πηγή: Operational Research: An International Journal. 25(1)

Packing squares independently

Συγγραφείς: Wu, Wei ^{a, ⁎}, Numaguchi, Hiroki ^b, Halman, Nir ^c, Hu, Yannan ^d, Yagiura, Mutsunori ^b

Πηγή: In Theoretical Computer Science 12 January 2025 1024

Load Balancing for Interdependent IoT Microservices

Συγγραφείς: Yu, Ruozhou, Kilari, Vishnu Teja, Xue, Guoliang, Yang, Dejun

Πηγή: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Computer Communications (INFOCOM), 2019 IEEE Conference on. :298-306 Apr, 2019

Relation: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications

Parallel-Batch Scheduling With Deterioration and Group Technology

Συγγραφείς: Miao, C.

Πηγή: IEEE Access Access, IEEE. 7:119082-119086 2019

The prize-collecting single machine scheduling with bounds and penalties

Συγγραφείς: Hu, Guojun^{Aff1, Aff2, IDs10878024012030_cor1}, Pan, Pengxiang, Liu, Suding^{Aff2, Aff3}, Yang, Ping, Xie, Runtao

Πηγή: Journal of Combinatorial Optimization. 48(2)

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines

Συγγραφείς: Sun, Ruiqing^{Aff1, IDs1087802401118w_cor1}

Πηγή: Journal of Combinatorial Optimization. 47(3)

Assortment optimization under the multinomial logit choice model with product-specific capacities

Συγγραφείς: Huh, Woonghee Tim, Liu, Siyue

Πηγή: Operations Research Letters. 59:107238

Θεματικοί όροι: fully polynomial-time approximation scheme (FPTAS), assortment optimization, Operations research, mathematical programming, product-specific capacities

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8036075
https://doi.org/10.1016/j.orl.2024.107238

The Bound Coverage Problem by Aligned Disks in Metric

Συγγραφείς: Liu, Xiaofei^Aff10, Liu, Zhonghao^Aff11

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Zhang, Yong, editor^Aff7, Miao, Dongjing, editor^Aff8, Möhring, Rolf, editor^Aff9

Πηγή: Computing and Combinatorics : 28th International Conference, COCOON 2022, Shenzhen, China, October 22–24, 2022, Proceedings. 13595:305-312

Approximation Scheme for Single-Machine Rescheduling with Job Delay and Rejection

Συγγραφείς: Sun, Ruiqing^Aff9, Liu, Xiaofei^Aff10

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Ni, Qiufen, editor^Aff7, Wu, Weili, editor^Aff8

Πηγή: Algorithmic Aspects in Information and Management : 16th International Conference, AAIM 2022, Guangzhou, China, August 13–14, 2022, Proceedings. 13513:35-45

Single-Machine Scheduling with Step-Deteriorating Jobs and Rejection

Συγγραφείς: Kong, Fan-Yu, Miao, Cui-Xia^{Aff1, IDs40305023004815_cor2}, Huo, Yu-Jia, Song, Jia-Xin, Zhang, Yu-Zhong

Πηγή: Journal of the Operations Research Society of China. :1-15

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

Συγγραφείς: Chen, Xin ^{a, ⁎}, Shen, Xuefeng ^a, Kovalyov, Mikhail Y. ^b, Sterna, Malgorzata ^c, Blazewicz, Jacek ^{c, d}

Πηγή: In Computers & Industrial Engineering September 2022 171

When is approximate counting for conjunctive queries tractable?

Συγγραφείς: Arenas, Marcelo, Croquevielle, Luis Alberto, Jayaram, Rajesh, Riveros, Cristian

Πηγή: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. :1015-1027

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3406325.3451014

A fully polynomial time approximation scheme for the probability maximizing shortest path problem

Συγγραφείς: Lee, Jisun ^a, Joung, Seulgi ^{⁎, c}, Lee, Kyungsik ^{⁎, b}

Πηγή: In European Journal of Operational Research 1 July 2022 300(1):35-45

The approximation scheme for peak power driven voltage partitioning

Συγγραφείς: Wang, Jia, Chen, Xiaodao, Liao, Chen, Hu, Shiyan

Πηγή: 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) Computer-Aided Design (ICCAD), 2011 IEEE/ACM International Conference on. :736-741 Nov, 2011

Relation: 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date

Συγγραφείς: Li, Wei-Dong^{Aff1, IDs4030502200402y_cor1}

Πηγή: Journal of the Operations Research Society of China. :1-10

A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment

Συγγραφείς: Hu, S., Li, Z., Alpert, C. J.

Πηγή: IEEE Transactions on Circuits and Systems II: Express Briefs IEEE Trans. Circuits Syst. II Circuits and Systems II: Express Briefs, IEEE Transactions on. 56(7):580-584 Jul, 2009

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

Συγγραφείς: Chen, Xin ^a, Liang, Yage ^b, Sterna, Małgorzata ^{⁎, c}, Wang, Wen ^a, Błażewicz, Jacek ^{c, d, e}

Πηγή: In European Journal of Operational Research 1 July 2020 284(1):67-74

Approximation algorithms for the three-machine proportionate mixed shop scheduling

Συγγραφείς: Liu, Longcheng ^{a, b}, Chen, Yong ^{c, b}, Dong, Jianming ^{d, b}, Goebel, Randy ^b, Lin, Guohui ^{b, ⁎}, Luo, Yue ^a, Ni, Guanqun ^{e, b}, Su, Bing ^f, Xu, Yao ^b, Zhang, An ^{c, b}

Πηγή: In Theoretical Computer Science 10 January 2020 803:57-70

Approximation issues of fractional knapsack with penalties: a note

Συγγραφείς: Kovalev, Sergey^{Aff1, IDs10288021004741_cor1}

Πηγή: 4OR: A Quarterly Journal of Operations Research. :1-8