Suchergebnisse - random pseudo-polynomial algorithm

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions

Autoren: Endre Boros Khaled Elbassioni Vladimir Gurvich et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783642392054

Schlagwörter: FOS: Computer and information sciences, Computer Science - Computer Science and Game Theory, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science and Game Theory (cs.GT)

Zugangs-URL: http://arxiv.org/pdf/1508.03431
http://arxiv.org/abs/1508.03431
https://dblp.uni-trier.de/db/journals/iandc/iandc267.html#BorosEGM19
https://www.sciencedirect.com/science/article/pii/S0890540119300239

Random pseudo-polynomial algorithms for some combinatorial programming problems

Autoren: GALBIATI, GIULIA F. Maffioli Galbiati, Giulia et al.

Weitere Verfasser: GALBIATI, GIULIA F. Maffioli Galbiati, Giulia et al.

Quelle: European Journal of Operational Research. 58:223-235

Schlagwörter: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, Combinatorial optimization, random pseudo-polynomial algorithms, 0211 other engineering and technologies, Network, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Computational Analysi, Programming involving graphs or networks, weighted combinatorial problems, 01 natural sciences, Computational methods for problems pertaining to operations research and mathematical programming, survey, Abstract computational complexity for mathematical programming problems, Integer Programming

Dateibeschreibung: application/xml; STAMPA

Zugangs-URL: https://zbmath.org/68474
https://doi.org/10.1016/0377-2217(92)90209-r
https://www.sciencedirect.com/science/article/pii/037722179290209R
https://ideas.repec.org/a/eee/ejores/v58y1992i2p223-235.html

Random pseudo-polynomial algorithms for exact matroid problems

Autoren: P. M. Camerini F. Maffioli GALBIATI, GIULIA et al.

Weitere Verfasser: P. M. Camerini F. Maffioli GALBIATI, GIULIA et al.

Quelle: Journal of Algorithms. 13:258-273

Schlagwörter: Matroid Base, Analysis of algorithms and problem complexity, 4. Education, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Combinatorial aspects of matroids and geometric lattices, perfect matchings, 01 natural sciences, 7. Clean energy, pseudo-polynomial algorithm, weighted graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Randomized Algorithm, matroid, Parity Conditions, Parallel algorithms in computer science

Dateibeschreibung: application/xml; STAMPA

Zugangs-URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.2290
https://www.sciencedirect.com/science/article/abs/pii/0196677492900188
http://dblp.uni-trier.de/db/journals/jal/jal13.html#CameriniGM92
https://core.ac.uk/display/21178947
https://dl.acm.org/doi/10.1016/0196-6774%2892%2990018-8
https://dblp.uni-trier.de/db/journals/jal/jal13.html#CameriniGM92

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.

Autoren: Boros, Endre Elbassioni, Khaled Gurvich, Vladimir et al.

Quelle: Information & Computation. Aug2019, Vol. 267, p74-95. 22p.

Schlagwörter: *NONCOOPERATIVE games (Mathematics), *POLYNOMIAL time algorithms, *RANDOM numbers, *ALGORITHMS, *GAMES

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions

Autoren: Boros, Endre Elbassioni, Khaled Gurvich, Vladimir et al.

Index Begriffe: Computer Science - Computer Science and Game Theory, text

URL: http://arxiv.org/abs/1508.03431

Polymatroids: construction and random algorithms: Polymatroids: Construction and random algorithms

Autoren: M. Trubian P. M. Camerini

Quelle: Calcolo. 27:203-218

Schlagwörter: random pseudo-polynomial algorithm, Extended Exact Parity Base, 0102 computer and information sciences, Combinatorial aspects of matroids and geometric lattices, polymatroid, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/24625
https://doi.org/10.1007/bf02575795
https://link.springer.com/article/10.1007/BF02575795

Near-optimal Algorithms for Stochastic Online Bin Packing.

Autoren: Ayyadevara, Nikhil Dabas, Rajni Khan, Arindam et al.

Quelle: ACM Transactions on Algorithms; Apr2025, Vol. 21 Issue 2, p1-39, 39p

Schlagwörter: ONLINE algorithms, POLYNOMIAL time algorithms, APPROXIMATION algorithms, BIN packing problem, RANDOM sets, ALGORITHMS

Solving The Capacitated Hybrid Vehicle Routing Problem Using a Random General Variable Neighborhood Search: Computational Experiments.

Autoren: Ammar, Amira Belhadj Cheikh, Mohamed Loukil, Taicir Moalla

Quelle: International Journal of Supply & Operations Management; Aug2025, Vol. 12 Issue 3, p318-335, 18p

Schlagwörter: VEHICLE routing problem, OPTIMIZATION algorithms, MIXED integer linear programming, ECOLOGICAL impact, SUSTAINABLE transportation, COMPUTER simulation

A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions

Autoren: Borosz, Endre Elbassionix, Khaled Gurvich, Vladimir et al.

Schlagwörter: ddc:510

Dateibeschreibung: application/pdf

Relation: https://doi.org/10.34657/1861; https://oa.tib.eu/renate/handle/123456789/2857

Verfügbarkeit: https://oa.tib.eu/renate/handle/123456789/2857
https://doi.org/10.34657/1861

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

Autoren: Khan, Arindam Lonkar, Aditya Maiti, Arnab et al.

Quelle: ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-30, 30p

Schlagwörter: NP-hard problems, PACKING problem (Mathematics), POLYNOMIAL time algorithms, MATHEMATICAL optimization, BIN packing problem, APPROXIMATION algorithms

DISCRETE OPTIMAL TRANSPORT WITH INDEPENDENT MARGINALS IS #P-HARD.

Autoren: TAŞKESEN, BAHAR SHAFIEEZADEH-ABADEH, SOROOSH KUHN, DANIEL et al.

Quelle: SIAM Journal on Optimization; 2023, Vol. 33 Issue 2, p589-614, 26p

Schlagwörter: POLYNOMIAL time algorithms, DISTRIBUTION (Probability theory), COMPUTATIONAL complexity, RANDOM variables, ALGORITHMS, RANDOM graphs

Parallel-batching scheduling with two agents, release dates and equal processing times.

Autoren: Li, Shi-Sheng Chen, Ren-Xia

Quelle: International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p9799-9820, 22p

FlowerCast: Efficient Time-sensitive Multicast in Wireless Sensor Networks with Link Uncertainty.

Autoren: JIANZHI TANG LUOYI FU SHIYU LIANG et al.

Quelle: ACM Transactions on Sensor Networks; Jan2024, Vol. 20 Issue 1, p1-32, 32p

Schlagwörter: MULTICASTING (Computer networks), WIRELESS sensor networks, ROUTING algorithms, CONSTRUCTION delays, RANDOM graphs, TIME-varying networks, FLOWERING trees

A Hierarchical Framework and Marginal Return Optimization for Dynamic Task Allocation in Heterogeneous UAV Networks.

Autoren: Guo, Anxin Zhang, Zhenxing Wu, Ao et al.

Quelle: Sensors (14248220); Nov2025, Vol. 25 Issue 21, p6676, 22p

Schlagwörter: DRONE aircraft, MULTIAGENT systems, HEURISTIC algorithms, MULTILEVEL models, WORK structure

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: APPROXIMATION algorithms, SCHEDULING, PRODUCTION scheduling, MANUFACTURING industries, SUPPLEMENTARY employment

Maximum Box Problem on Stochastic Points.

Autoren: Caraballo, Luis E. Pérez-Lantero, Pablo Seara, Carlos et al.

Quelle: Algorithmica; Dec2021, Vol. 83 Issue 12, p3741-3765, 25p

Schlagwörter: RANDOM sets, RANDOM variables, POINT set theory, ALGORITHMS, RECTANGLES

Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.

Autoren: Chen, Rubing Gao, Yuan Geng, Zhichao et al.

Quelle: International Journal of Production Research; Nov2023, Vol. 61 Issue 22, p7630-7648, 19p, 4 Diagrams, 12 Charts

Schlagwörter: POLYNOMIAL time algorithms, NP-hard problems, SCHEDULING, ALGORITHMS, WORKING hours

Decision models for order fulfillment processes of online food delivery platforms: a systematic review.

Autoren: Ashraf, Saad Bardhan, Amit Kumar

Quelle: International Journal of Production Research; Jul2025, Vol. 63 Issue 13, p4991-5029, 39p

Schlagwörter: DELIVERY of goods, MACHINE learning, OPERATIONS research, ORDER picking systems, LOCAL delivery services, HEURISTIC

A combinatorial Benders decomposition approach for the constrained two-dimensional guillotine cutting problem with defects.

Autoren: Yao, Shaowen Wang, Sunkanghong Zhang, Tai et al.

Quelle: International Journal of Production Research; Dec2025, Vol. 63 Issue 23, p8593-8610, 18p

A Vehicle Routing Problem Based on a Long-Distance Transportation Network with an Exact Optimization Algorithm.

Autoren: Emre, Toygar Erol, Rızvan

Quelle: Mathematics (2227-7390); Nov2025, Vol. 13 Issue 21, p3397, 40p

Schlagwörter: VEHICLE routing problem, TRANSPORTATION costs, FREIGHT & freightage, LOGISTICS, COLUMN generation (Algorithms), TRUCKLOAD shipping, OPTIMIZATION algorithms

Geografische Kategorien: UNITED States