Open Access
Issue
RAIRO-Oper. Res.
Volume 59, Number 1, January-February 2025
Page(s) 325 - 333
DOI https://doi.org/10.1051/ro/2024232
Published online 21 January 2025
  • N. Alon, Y. Azar, G.J. Woeginger and T. Yadid, Approximation schemes for scheduling on parallel machines. J. Sched. 1 (1998) 55–66. [CrossRef] [MathSciNet] [Google Scholar]
  • A. Berger, V. Bonifaci, F. Grandoni and G. Sch¨afer, Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Prog. 128 (2011) 355–372. [CrossRef] [Google Scholar]
  • G. Dósa, R. Li, X. Han and Z. Tuza, Tight absolute bound for First Fit Decreasing bin-packing: FFD(L) 11/9OPT(L) + 6/9. Theor. Comput. Sci. 510 (2013) 13–61. [CrossRef] [Google Scholar]
  • L. Epstein, A. Levin and G.J. Woeginger, Vertex cover meets scheduling. Algorithmica 74 (2016) 1148–1173. [CrossRef] [MathSciNet] [Google Scholar]
  • W. Fernandez de La Vega and G.S. Lueker, Bin packing can be solved within 1 + ε in linear time. Combinatorica 1 (1981) 349–355. [CrossRef] [MathSciNet] [Google Scholar]
  • L. Guan, J. Li, W. Li and J. Lichen, Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38 (2019) 689–697. [CrossRef] [MathSciNet] [Google Scholar]
  • R. Hassin, Approximation schemes for the restricted shortest path problems. Math. Oper. Res. 17 (1992) 36–42. [CrossRef] [MathSciNet] [Google Scholar]
  • R. Hassin and A. Levin, An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33 (2004) 261–268. [CrossRef] [MathSciNet] [Google Scholar]
  • D.S. Hochbaum and D.B. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34 (1987) 144–162. [CrossRef] [Google Scholar]
  • M. Holzhauser and S.O. Krumke, A generalized approximation framework for fractional network flow and packing problems. Math. Methods Oper. Res. 87 (2018) 19–50. [CrossRef] [MathSciNet] [Google Scholar]
  • M. Holzhauser, S.O. Krumke and C. Thielen, On the complexity and approximability of budget-constrained minimum cost flows. Inf. Process. Lett. 126 (2017) 24–29. [CrossRef] [Google Scholar]
  • N. Karmarkar and R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in Proceedings of 23rd Annual Symposium on Foundations of Computer Science (FOCS) (1982) 312–320. [Google Scholar]
  • S.G. Nurre and T.C. Sharkey, Integrated network design and scheduling problems with parallel identical machines: complexity and dispatching rules. Networks 63 (2014) 306–326. [CrossRef] [MathSciNet] [Google Scholar]
  • S.G. Nurre, B. Cavdaroglu, J.E. Mitchell, T.C. Sharkey and W.A. Wallace, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem. Eur. J. Oper. Res. 223 (2012) 794–806. [CrossRef] [Google Scholar]
  • Y. Saito and A. Shioura, Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines, in 7th International Symposium on Combinatorial Optimization (ISCO) (2022) 324–335. [Google Scholar]
  • Z. Wang and Z. Cui, Combination of parallel machine scheduling and vertex cover. Theor. Comput. Sci. 460 (2012) 10–15. [CrossRef] [Google Scholar]
  • Z. Wang, W. Hong and D. He, A combination of parallel machine scheduling and the covering problem. Pac. J. Optim. 10 (2014) 577–591. [MathSciNet] [Google Scholar]
  • A. Warburton, Approximation of Pareto optima in multiple-objective shortest path problems. Oper. Res. 35 (1987) 70–79. [CrossRef] [MathSciNet] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.