Works matching Approximation algorithms
Results: 5000
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints.
- Published in:
- Journal of Optimization Theory & Applications, 2021, v. 190, n. 2, p. 524, doi. 10.1007/s10957-021-01893-0
- By:
- Publication type:
- Article
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms.
- Published in:
- Journal of Scheduling, 2023, v. 26, n. 4, p. 383, doi. 10.1007/s10951-022-00774-2
- By:
- Publication type:
- Article
The ordered k-median problem: surrogate models and approximation algorithms.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 55, doi. 10.1007/s10107-018-1259-3
- By:
- Publication type:
- Article
工件有到达时间及可拒绝下的同类 平行机排序问题的近似算法.
- Published in:
- Operations Research Transactions / Yunchouxue Xuebao, 2022, v. 26, n. 2, p. 73, doi. 10.15960/j.cnki.issn.1007-6093.2022.02.007
- By:
- Publication type:
- Article
经典一维装箱问题近似算法的研究进展.
- Published in:
- Operations Research Transactions / Yunchouxue Xuebao, 2022, v. 26, n. 1, p. 69, doi. 10.15960/j.cnki.issn.1007-6093.2022.01.005
- By:
- Publication type:
- Article
带有线性惩罚的鲁棒k-种产品设施选址问题的近似算法.
- Published in:
- Operations Research Transactions / Yunchouxue Xuebao, 2021, v. 25, n. 4, p. 31, doi. 10.15960/j.cnki.issn.1007-6093.2021.04.003
- By:
- Publication type:
- Article
An $$O(\lg \lg {\mathrm {OPT}})$$ -Approximation Algorithm for Multi-guarding Galleries.
- Published in:
- Discrete & Computational Geometry, 2015, v. 53, n. 2, p. 327, doi. 10.1007/s00454-014-9656-8
- By:
- Publication type:
- Article
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks.
- Published in:
- Discrete & Computational Geometry, 2012, v. 48, n. 2, p. 373, doi. 10.1007/s00454-012-9417-5
- By:
- Publication type:
- Article
An improved approximation algorithm for the $ k $-prize-collecting minimum power cover problem.
- Published in:
- Journal of Industrial & Management Optimization, 2024, v. 20, n. 4, p. 1, doi. 10.3934/jimo.2023140
- By:
- Publication type:
- Article
Approximation algorithms and heuristics for task scheduling in data‐intensive distributed systems.
- Published in:
- International Transactions in Operational Research, 2018, v. 25, n. 5, p. 1417, doi. 10.1111/itor.12527
- By:
- Publication type:
- Article
D-Optimal Data Fusion: Exact and Approximation Algorithms.
- Published in:
- INFORMS Journal on Computing, 2024, v. 36, n. 1, p. 97, doi. 10.1287/ijoc.2022.0235
- By:
- Publication type:
- Article
An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem.
- Published in:
- INFORMS Journal on Computing, 2023, v. 35, n. 5, p. 1179, doi. 10.1287/ijoc.2021.0193
- By:
- Publication type:
- Article
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set.
- Published in:
- INFORMS Journal on Computing, 2018, v. 30, n. 2, p. 225, doi. 10.1287/ijoc.2017.0775
- By:
- Publication type:
- Article
Approximation Algorithms for Integrated Distribution Network Design Problems.
- Published in:
- INFORMS Journal on Computing, 2013, v. 25, n. 3, p. 572, doi. 10.1287/ijoc.1120.0522
- By:
- Publication type:
- Article
On Approximation Algorithm for Orthogonal Low-Rank Tensor Approximation.
- Published in:
- Journal of Optimization Theory & Applications, 2022, v. 194, n. 3, p. 821, doi. 10.1007/s10957-022-02050-x
- By:
- Publication type:
- Article
A COMPUTATIONAL STUDY OF APPROXIMATION ALGORITHMS FOR A MINMAX RESOURCE ALLOCATION PROBLEM.
- Published in:
- Operations Research & Decisions, 2012, v. 22, n. 2, p. 35, doi. 10.5277/ord120202
- By:
- Publication type:
- Article
Approximation algorithms for stochastic clustering.
- Published in:
- Journal of Machine Learning Research, 2019, v. 20, n. 137-159, p. 1
- By:
- Publication type:
- Article
An approximation algorithm for the traveling tournament problem.
- Published in:
- Annals of Operations Research, 2012, v. 194, n. 1, p. 317, doi. 10.1007/s10479-010-0742-x
- By:
- Publication type:
- Article
MULTIVARIATE COMPACT LAW OF THE ITERATED LOGARITHM FOR AVERAGED STOCHASTIC APPROXIMATION ALGORITHMS.
- Published in:
- Serdica Mathematical Journal, 2020, v. 46, n. 4, p. 335
- By:
- Publication type:
- Article
Approximation algorithms for nonnegative polynomial optimization problems over unit spheres.
- Published in:
- Frontiers of Mathematics in China, 2017, v. 12, n. 6, p. 1409, doi. 10.1007/s11464-017-0644-1
- By:
- Publication type:
- Article
Approximation Algorithms for a New Truck Loading Problem in Urban Freight Transportation.
- Published in:
- Transportation Science, 2020, v. 54, n. 3, p. 690, doi. 10.1287/trsc.2019.0967
- By:
- Publication type:
- Article
A generic framework for approximation analysis of greedy algorithms for star bicoloring.
- Published in:
- Optimization Methods & Software, 2021, v. 36, n. 4, p. 869, doi. 10.1080/10556788.2019.1649671
- By:
- Publication type:
- Article
Approximation algorithms for some min–max postmen cover problems.
- Published in:
- Annals of Operations Research, 2021, v. 300, n. 1, p. 267, doi. 10.1007/s10479-021-03933-4
- By:
- Publication type:
- Article
Approximation Algorithms for the Load-Balanced Capacitated Vehicle Routing Problem.
- Published in:
- Bulletin of the Iranian Mathematical Society, 2021, v. 47, n. 4, p. 1261, doi. 10.1007/s41980-020-00440-3
- By:
- Publication type:
- Article
Improved approximation algorithms for some min–max postmen cover problems with applications to the min–max subtree cover.
- Published in:
- Mathematical Methods of Operations Research, 2023, v. 97, n. 1, p. 135, doi. 10.1007/s00186-022-00807-8
- By:
- Publication type:
- Article
Approximation algorithms for TTP(2).
- Published in:
- Mathematical Methods of Operations Research, 2012, v. 76, n. 1, p. 1, doi. 10.1007/s00186-012-0387-4
- By:
- Publication type:
- Article
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.
- Published in:
- Journal of Global Optimization, 2022, v. 84, n. 3, p. 687, doi. 10.1007/s10898-022-01163-x
- By:
- Publication type:
- Article
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors.
- Published in:
- Journal of Global Optimization, 2022, v. 84, n. 1, p. 229, doi. 10.1007/s10898-022-01140-4
- By:
- Publication type:
- Article
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
- Published in:
- Journal of Global Optimization, 2020, v. 77, n. 2, p. 319, doi. 10.1007/s10898-019-00852-4
- By:
- Publication type:
- Article
Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.
- Published in:
- Journal of Global Optimization, 2018, v. 70, n. 1, p. 207, doi. 10.1007/s10898-017-0566-1
- By:
- Publication type:
- Article
Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems.
- Published in:
- Journal of Global Optimization, 2017, v. 68, n. 3, p. 623, doi. 10.1007/s10898-017-0498-9
- By:
- Publication type:
- Article
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem.
- Published in:
- Journal of Global Optimization, 2010, v. 48, n. 3, p. 497, doi. 10.1007/s10898-009-9504-1
- By:
- Publication type:
- Article
Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems.
- Published in:
- Parallel Processing Letters, 2016, v. 26, n. 1, p. -1, doi. 10.1142/S0129626416500018
- By:
- Publication type:
- Article
Using Non-Subjective Approximation Algorithm of D-S Evidence Theory for Improving Data Fusion.
- Published in:
- International Journal of Performability Engineering, 2019, n. 10, p. 2692, doi. 10.23940/ijpe.19.10.p15.26922700
- By:
- Publication type:
- Article
Approximation Algorithms for the Maximum-Weight Cycle/Path Packing Problems.
- Published in:
- Asia-Pacific Journal of Operational Research, 2023, v. 40, n. 4, p. 1, doi. 10.1142/S0217595923400031
- By:
- Publication type:
- Article
Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem.
- Published in:
- Asia-Pacific Journal of Operational Research, 2023, v. 40, n. 1, p. 1, doi. 10.1142/S0217595922400085
- By:
- Publication type:
- Article
Shortest path with acceleration constraints: complexity and approximation algorithms.
- Published in:
- Computational Optimization & Applications, 2022, v. 83, n. 2, p. 555, doi. 10.1007/s10589-022-00403-w
- By:
- Publication type:
- Article
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
- Published in:
- Theory of Computing Systems, 2021, v. 65, n. 6, p. 985, doi. 10.1007/s00224-020-10025-6
- By:
- Publication type:
- Article
Approximation Algorithms for Connected Graph Factors of Minimum Weight.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 2, p. 441, doi. 10.1007/s00224-016-9723-z
- By:
- Publication type:
- Article
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 287, doi. 10.1007/s00224-015-9615-7
- By:
- Publication type:
- Article
An Improved Approximation Algorithm for the Most Points Covering Problem.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 545, doi. 10.1007/s00224-011-9353-4
- By:
- Publication type:
- Article
Approximation algorithms for Steiner forest: An experimental study.
- Published in:
- Networks, 2022, v. 79, n. 2, p. 164, doi. 10.1002/net.22046
- By:
- Publication type:
- Article
Approximation algorithms for energy-efficient scheduling of parallel jobs.
- Published in:
- Journal of Scheduling, 2020, v. 23, n. 6, p. 693, doi. 10.1007/s10951-020-00653-8
- By:
- Publication type:
- Article
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments.
- Published in:
- Journal of Scheduling, 2020, v. 23, n. 5, p. 595, doi. 10.1007/s10951-019-00633-7
- By:
- Publication type:
- Article
Approximation Algorithm for the Broadcast Time in k-Path Graph.
- Published in:
- Journal of Interconnection Networks, 2019, v. 19, n. 4, p. N.PAG, doi. 10.1142/S0219265919500063
- By:
- Publication type:
- Article
The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem.
- Published in:
- International Journal of Foundations of Computer Science, 2018, v. 29, n. 7, p. 1231, doi. 10.1142/S0129054118500314
- By:
- Publication type:
- Article
A (Slightly) Improved Approximation Algorithm for Metric TSP.
- Published in:
- Operations Research, 2024, v. 72, n. 6, p. 2543, doi. 10.1287/opre.2022.2338
- By:
- Publication type:
- Article
Approximation algorithm for frequent itemsets mining on uncertain dataset.
- Published in:
- Application Research of Computers / Jisuanji Yingyong Yanjiu, 2014, v. 31, n. 3, p. 725, doi. 10.3969/j.issn.1001-3695.2014.03.020
- By:
- Publication type:
- Article
Approximation algorithms for flexible graph connectivity.
- Published in:
- Mathematical Programming, 2024, v. 204, n. 1/2, p. 493, doi. 10.1007/s10107-023-01961-5
- By:
- Publication type:
- Article
Exact and approximation algorithms for weighted matroid intersection.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 85, doi. 10.1007/s10107-018-1260-x
- By:
- Publication type:
- Article