Suchergebnisse - "Approximation algorithms"

The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost.

Autoren: Li, Weidong Ou, Jinwen

Quelle: European Journal of Operational Research. Dec2025, Vol. 327 Issue 2, p420-431. 12p.

Schlagwörter: *MATHEMATICAL analysis, *COST control, ASSIGNMENT problems (Programming), APPROXIMATION algorithms, NP-hard problems

The quadratic knapsack problem.

Autoren: Galli, Laura Martello, Silvano Toth, Paolo

Quelle: European Journal of Operational Research. Oct2025, Vol. 326 Issue 1, p1-12. 12p.

Schlagwörter: *MATHEMATICAL models, KNAPSACK problems, APPROXIMATION algorithms, COMBINATORIAL optimization, METAHEURISTIC algorithms

Joint Placement, Delivery Promise, and Fulfillment in Online Retail.

Autoren: Bai, Yicheng Rusmevichientong, Paat Topaloglu, Huseyin

Quelle: Management Science. Nov2025, Vol. 71 Issue 11, p9171-9192. 22p.

Schlagwörter: *ELECTRONIC commerce, *PROFITABILITY, *LOGISTICS, *LOCATION analysis, *WAREHOUSES, APPROXIMATION algorithms

ℓ p -Sphere Covering and Approximating Nuclear p -Norm.

Autoren: Guan, Jiewen He, Simai Jiang, Bo et al.

Quelle: Mathematics of Operations Research. Nov2025, Vol. 50 Issue 4, p3094-3124. 31p.

Schlagwörter: *MATHEMATICAL optimization, APPROXIMATION algorithms, CALCULUS of tensors, SUPERVISED learning, TENSOR algebra, MATRIX norms

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes.

Autoren: Brubach, Brian Grammel, Nathaniel Ma, Will et al.

Quelle: Mathematics of Operations Research. Nov2025, Vol. 50 Issue 4, p3243-3256. 14p.

Schlagwörter: *MATHEMATICAL optimization, *PROBLEM solving, MATCHING theory, APPROXIMATION algorithms, BIPARTITE graphs, GRAPH theory

Accurate and efficient approximation of large-scale appointment schedules.

Autoren: Bekker, R. Bharti, B. Mandjes, M.

Quelle: Stochastic Models. 2025, Vol. 41 Issue 4, p528-556. 29p.

Schlagwörter: *DISTRIBUTION (Probability theory), *RANDOM variables, *MATHEMATICAL programming, APPROXIMATION algorithms, MEDICAL appointments, MEDICAL care wait times

On The 4-Adic Complexity of Quaternary Cyclotomic Sequences of Order 4 with Even Length.

Autoren: Liu, Xuanyu Yan, Feifei Ke, Pinhui

Quelle: International Journal of Foundations of Computer Science. Nov2025, p1-18. 18p.

Schlagwörter: AUTOCORRELATION (Statistics), APPROXIMATION algorithms, MATHEMATICAL mappings, COMPUTATIONAL complexity, MATHEMATICAL sequences

Two parallel-machine scheduling with maximum waiting time for an emergency job.

Autoren: Jiang, Yiwei Yuan, Haodong Zhou, Ping et al.

Quelle: International Journal of Production Research. Aug2024, Vol. 62 Issue 16, p6016-6027. 12p.

Schlagwörter: *SCHEDULING, *PRODUCTION scheduling, *MANUFACTURING industries, *SUPPLEMENTARY employment, APPROXIMATION algorithms

Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities.

Autoren: Ou, Jinwen Li, Weidong

Quelle: European Journal of Operational Research. Jan2026, Vol. 328 Issue 2, p407-414. 8p.

Schlagwörter: *PRODUCTION scheduling, *BATCH processing, *SCHEDULING, APPROXIMATION algorithms, TIME measurements

Nonadaptive Stochastic Score Classification and Explainable Half-Space Evaluation.

Autoren: Ghuge, Rohan Gupta, Anupam Nagarajan, Viswanath

Quelle: Operations Research. Jul/Aug2025, Vol. 73 Issue 4, p2204-2222. 19p.

Schlagwörter: *MATHEMATICS, *STOCHASTIC processes, APPROXIMATION algorithms, CLASSIFICATION, COST functions, COMPUTER simulation

Joint chance-constrained survivable capacitated multi-commodity network design problem with demand uncertainty.

Autoren: Khodayifar, Salman Farjaie, Mohammadreza

Quelle: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 5, p2993-3014. 22p.

Schlagwörter: *SYSTEMS design, *UNCERTAINTY (Information theory), COPULA functions, APPROXIMATION algorithms, PIECEWISE linear approximation, STOCHASTIC programming, APPROXIMATION error

Exact and approximation algorithms for routing a convoy through a graph.

Autoren: van Ee, Martijn Oosterwijk, Tim Sitters, René et al.

Quelle: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p985-1008. 24p.

Schlagwörter: *TRAVELING salesman problem, ROUTING algorithms, APPROXIMATION algorithms, NP-hard problems, ROUTING systems, MATHEMATICAL functions, VEHICLE routing problem, CARAVANS (Groups of travelers)

Structural iterative rounding for generalized k-median problems.

Autoren: Gupta, Anupam Moseley, Benjamin Zhou, Rudy

Quelle: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p581-634. 54p.

Schlagwörter: *ALGORITHMS, *MATHEMATICS, *CONFERENCES & conventions, APPROXIMATION algorithms, COMBINATORIAL optimization

Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights.

Autoren: Ding, Wei Chen, Guangting Qiu, Ke et al.

Quelle: Asia-Pacific Journal of Operational Research. Aug2025, Vol. 42 Issue 4, p1-19. 19p.

Schlagwörter: WEIGHTED graphs, APPROXIMATION algorithms, GRAPH theory, DIAMETER

Improved Approximation Algorithms for Matroid and Knapsack Means Problems.

Autoren: Zhao, Ao Zhou, Yang Liu, Qian

Quelle: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p709-729. 21p.

Schlagwörter: APPROXIMATION algorithms, MATROIDS, K-means clustering, KNAPSACK problems, SUBMODULAR functions

Restricted Existence and Approximation Algorithms for PMMS.

Autoren: Guo, Xinru Dai, Sijia Gao, Guichen et al.

Quelle: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p683-695. 13p.

Schlagwörter: *RESOURCE allocation, APPROXIMATION algorithms, GRAPH theory, TIME complexity, OPTIMIZATION algorithms

Improved Approximation Algorithms for Bin Packing with Conflicts.

Autoren: Huang, Zhihua Zhang, An Dósa, György et al.

Quelle: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p667-682. 16p.

Schlagwörter: *BIN packing problem, APPROXIMATION algorithms, GRAPH coloring, BIPARTITE graphs, GRAPH theory, INDEPENDENT sets

Envy-Free Division of Multilayered Cakes.

Autoren: Igarashi, Ayumi Meunier, Frédéric

Quelle: Mathematics of Operations Research. Aug2025, Vol. 50 Issue 3, p2261-2286. 26p.

Schlagwörter: *ALGORITHMS, *RESOURCE allocation, APPROXIMATION algorithms, CONSTRAINT satisfaction, FIXED point theory, PASTRY

Inner δ-approximation of the convex hull of finite sets.

Autoren: Hoang, Nam-Dũng Linh, Nguyen Kieu Phu, Hoang Xuan

Quelle: Computational Optimization & Applications. Jul2025, Vol. 91 Issue 3, p1373-1413. 41p.

Schlagwörter: APPROXIMATION algorithms, COMPUTATIONAL geometry, TIME complexity, CONVEX functions, POLYHEDRA

Computation of Geometric Color-Spanning Region for Line Segments.

Autoren: Sadhu, Sanjib Maji, Sukanya

Quelle: International Journal of Foundations of Computer Science. Sep2025, p1-30. 30p.

Schlagwörter: PERIMETERS (Geometry), APPROXIMATION algorithms, GEOMETRIC shapes, WIDTH measurement