Treffer 1 - 20
von 2.558
- 1
- 2
Seite in der Trefferliste auswählen
Approximation algorithms for integer programming with resource augmentation
Brinkop, Hauke ; Chen, Hua ; Chen, Lin ; et al.
Non-Preemptive Min-Sum Scheduling with Resource Augmentation
Bansal, N. ; Chan, H.-L. ; Khandekar, R. ; et al.
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on. :614-624 Oct, 2007
Approximation Algorithms for Interdiction Problem with Packing Constraints
Chen, Lin ; Wu, Xiaoyu ; Zhang, Guochuan ; et al.
Maximizing throughput and energy efficiency in 6G based on phone user clustering enabled UAV assisted downlink hybrid multiple access HetNet.
Ghafoor, Umar ; Ashraf, Tahreem
Telecommunication Systems; Apr2024, Vol. 85 Issue 4, p563-590, 28p
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Cristi, Andrés ; Mari, Mathieu ; Wiese, Andreas
Theory of Computing Systems. Feb2023, Vol. 67 Issue 1, p89-124. 36p.
Scheduling with Many Shared Resources
Deppert, Max A. ; Jansen, Klaus ; Maack, Marten ; et al.
Robust network function virtualization.
Lin, Tachun ; Zhou, Zhili
Networks; Jun2020, Vol. 75 Issue 4, p438-462, 25p
Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks.
Chen, Jian-Jia ; Chakraborty, Samarjit
Real-Time Systems; Jul2013, Vol. 49 Issue 4, p475-516, 42p
Optimization of Computer Networks : Modeling and Algorithms: A Hands-On Approach
Pablo Pavón Mariño, Author ; Pablo Pavón Mariño
Dieses Ergebnis kann Gästen nicht angezeigt werden.
Login für vollen Zugriff.
A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR UNSPLITTABLE FLOW ON PATHS.
BONSMA, PAUL ; SCHULZ, JENS ; WIESE, ANDREAS
SIAM Journal on Computing; 2014, Vol. 43 Issue 2, p767-799, 33p
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
Bansal, Nikhil ; Oosterwijk, Tim ; Vredeveld, Tjark ; et al.
Algorithmica; Dec2016, Vol. 76 Issue 4, p1077-1096, 20p
Scheduling twin robots on a line.
Erdoğan, Güneş ; Battarra, Maria ; Laporte, Gilbert
Naval Research Logistics. Mar2014, Vol. 61 Issue 2, p119-130. 22p.
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship.
Caragiannis, Ioannis ; Filos-Ratsikas, Aris ; Frederiksen, Søren Kristoffer Stiil ; et al.
Mathematical Programming. Jan2024, Vol. 203 Issue 1/2, p901-930. 30p.
FPT algorithms for a special block-structured integer program with applications in scheduling.
Chen, Hua ; Chen, Lin ; Zhang, Guochuan
Mathematical Programming. Nov2024, Vol. 208 Issue 1/2, p463-496. 34p.
Ensemble Variance Reduction Methods for Stochastic Mixed-Integer Programming and their Application to the Stochastic Facility Location Problem.
Xu, Jiajun ; Sen, Suvrajeet
INFORMS Journal on Computing. Mar/Apr2024, Vol. 36 Issue 2, p587-599. 13p.
Exponentially Faster Massively Parallel Maximal Matching.
BEHNEZHAD, SOHEIL ; HAJIAGHAYI, MOHAMMADTAGHI ; HARRIS, DAVID G.
Journal of the ACM. Oct2023, Vol. 70 Issue 5, p1-18. 18p.
Uncovering illicit supply networks and their interfaces to licit counterparts through graph-theoretic algorithms.
Anzoom, Rashid ; Nagi, Rakesh ; Vogiatzis, Chrysafis
IISE Transactions. March 2024, Vol. 56 Issue 3, p224-240. 17p.
A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines.
Cohen, Ilan Reuven ; Cohen, Izack ; Zaks, Iyar
Annals of Operations Research. Jul2024, Vol. 338 Issue 1, p429-452. 24p.
Variants of the ε-constraint method for biobjective integer programming problems: application to
Sáez-Aguado, Jesús ; Trandafir, Paula Camelia
Mathematical Methods of Operations Research. Apr2018, Vol. 87 Issue 2, p251-283. 33p. 4 Diagrams, 7 Charts.
- 1
- 2