Suchergebnisse - "Fully polynomial time approximation scheme"

A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand

Autoren: Aaron Willcock Nathan Fisher Thidapat (Tam) Chantem

Quelle: Proceedings of the 32nd International Conference on Real-Time Networks and Systems. :175-186

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/10919/124521
https://doi.org/10.1145/3696355.3696367

Facility Location Under Nonlinear Customer Demand: A Fully Polynomial-Time Approximation Scheme

Autoren: Ba Luat Le Thuy Anh Ta Ngoc Anh Vu Thi et al.

Quelle: Lecture Notes in Computer Science ISBN: 9789819663880

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches

Autoren: In-Jae Jeong

Quelle: Engineering Optimization. 57:1323-1342

A Fully Polynomial Time Approximation Scheme for Constrained MDPs Under Local Transitions

Autoren: Majid Khonji

Quelle: 2023 62nd IEEE Conference on Decision and Control (CDC). :1782-1789

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

Autoren: Grange, Aristide Kacem, Imed Martin, Sébastien et al.

Weitere Verfasser: Grange, Aristide Kacem, Imed Martin, Sébastien et al.

Quelle: RAIRO - Operations Research. 57:1-16

Schlagwörter: dynamic programming, 0103 physical sciences, 0211 other engineering and technologies, scheduling, [MATH] Mathematics [math], 02 engineering and technology, FPTAS, 01 natural sciences, Approximation algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.science/hal-03936905v1/document
https://doi.org/10.1051/ro/2022022
https://hal.science/hal-03936905v1

A Fully Polynomial Time Approximation Scheme for Adaptive Variable Rate Task Demand

Autoren: Willcock, Aaron Fisher, Nathan Chantem, Thidapat (Tam)

Index Begriffe: Article - Refereed

A fully polynomial time approximation scheme for the probability maximizing shortest path problem

Autoren: Seulgi Joung Jisun Lee Kyungsik Lee

Quelle: European Journal of Operational Research. 300:35-45

Schlagwörter: 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0377221721008638

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Autoren: Halman, Nir Klabjan, Diego Mostagir, Mohamed et al.

Quelle: Mathematics of Operations Research, 2009 Aug 01. 34(3), 674-685.

Zugangs-URL: https://www.jstor.org/stable/40538438

A fully polynomial time approximation scheme for the Replenishment Storage problem.

Autoren: Hochbaum, Dorit S Rao, Xu

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/96w1c7x6
https://escholarship.org/content/qt96w1c7x6/qt96w1c7x6.pdf

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

Autoren: Karger, David R.

Quelle: SIAM Review, 2001 Sep 01. 43(3), 499-522.

Zugangs-URL: https://www.jstor.org/stable/3649796

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

Autoren: Yage Liang Jacek Blazewicz Malgorzata Sterna et al.

Quelle: European Journal of Operational Research. 284:67-74

Schlagwörter: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: https://ideas.repec.org/a/eee/ejores/v284y2020i1p67-74.html
https://dblp.uni-trier.de/db/journals/eor/eor284.html#ChenLSWB20
https://sin.put.poznan.pl/publications/details/i25534
https://www.sciencedirect.com/science/article/abs/pii/S0377221719309877

A fully polynomial time approximation scheme for the smallest diameter of imprecise points

Autoren: Ali Mohades Vahideh Keikha Maarten Löffler

Quelle: Theoretical Computer Science. 814:259-270

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0304397520300906
https://doi.org/10.1016/j.tcs.2020.02.006
https://dblp.uni-trier.de/db/journals/tcs/tcs814.html#KeikhaLM20

A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint

Autoren: Yufang Zhao Mengzhuo Bai

Quelle: Engineering Optimization. 52:1313-1322

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.tandfonline.com/doi/full/10.1080/0305215X.2019.1650922
http://ui.adsabs.harvard.edu/abs/2020EnOp...52.1313B/abstract

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

Autoren: Chou-Jung Hsu Chuanli Zhao

Quelle: Engineering Optimization. 51:1938-1943

Schlagwörter: 8. Economic growth, 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.tandfonline.com/doi/full/10.1080/0305215X.2018.1558446
http://ui.adsabs.harvard.edu/abs/2019EnOp...51.1938Z/abstract

A Fully Polynomial Time Approximation Scheme for Constrained MDPs and Stochastic Shortest Path under Local Transitions

Autoren: Khonji, Majid

Index Begriffe: Computer Science - Artificial Intelligence, text

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

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops

Autoren: Ruyan Jin Jueliang Hu Jianming Dong et al.

Quelle: Journal of Combinatorial Optimization. 37:668-684

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jco/jco37.html#DongJHL19
https://link.springer.com/article/10.1007/s10878-018-0314-6
https://ideas.repec.org/a/spr/jcomop/v37y2019i2d10.1007_s10878-018-0314-6.html

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy

Autoren: Halman, Nir Nir Halman

Weitere Verfasser: Halman, Nir Nir Halman

Quelle: Theoretical Computer Science. 645:41-47

Schlagwörter: dynamic programming, 2. Zero hunger, Approximate counting, 0211 other engineering and technologies, integer knapsack, 02 engineering and technology, ddc:004, bounding constraints, $K$-approximating sets and functions

Dateibeschreibung: application/pdf

Zugangs-URL: http://www.sciencedirect.com/science/article/pii/S0304397516302511
http://www.optimization-online.org/DB_FILE/2015/12/5231.pdf
https://dl.acm.org/doi/10.1016/j.tcs.2016.06.015
https://dblp.uni-trier.de/db/journals/tcs/tcs645.html#Halman16
https://www.sciencedirect.com/science/article/pii/S0304397516302511
https://core.ac.uk/display/62922892
https://dblp.uni-trier.de/db/conf/approx/approx2016.html#Halman16
https://drops.dagstuhl.de/opus/volltexte/2016/6632/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.9

A new fully polynomial time approximation scheme for the interval subset sum problem

Autoren: Ya-Feng Liu Yu-Hong Dai Rui Diao

Quelle: Journal of Global Optimization. 68:749-775

Schlagwörter: FOS: Computer and information sciences, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Numerical Analysis (math.NA), 0102 computer and information sciences, 02 engineering and technology, Mathematics - Optimization and Control, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1704.06928
http://arxiv.org/abs/1704.06928
https://arxiv.org/pdf/1704.06928.pdf
https://www.arxiv.org/abs/1704.06928
https://arxiv.org/abs/1704.06928
https://ideas.repec.org/a/spr/jglopt/v68y2017i4d10.1007_s10898-017-0514-0.html
https://link.springer.com/article/10.1007/s10898-017-0514-0
https://dblp.uni-trier.de/db/journals/corr/corr1704.html#DiaoLD17
http://ui.adsabs.harvard.edu/abs/2017arXiv170406928D/abstract
https://link.springer.com/article/10.1007/s10898-017-0514-0/fulltext.html

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines

Autoren: Imed Kacem Myriam Sahnoune Günter Schmidt

Quelle: RAIRO - Operations Research. 51:1177-1188

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf
https://hal.archives-ouvertes.fr/hal-02925348/document
https://hal.archives-ouvertes.fr/hal-02925348
https://www.rairo-ro.org/articles/ro/ref/2017/04/ro160218/ro160218.html
https://www.rairo-ro.org/articles/ro/pdf/2017/04/ro160218.pdf
https://hal.univ-lorraine.fr/hal-01784175
http://www.sciencedirect.com/science/article/pii/S2405896316309168
https://www.sciencedirect.com/science/article/abs/pii/S2405896316309168

A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem

Autoren: Hochbaum, Dorit S. Rao, Xu

Index Begriffe: Computer Science - Data Structures and Algorithms, text

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