Výsledky vyhľadávania - "pseudo-polynomial time algorithms"

Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio

Autori: Kanellopoulos, Sotiris Mitropoulos, Giorgos Antonopoulos, Antonis a ďalší

Prispievatelia: Kanellopoulos, Sotiris Mitropoulos, Giorgos Antonopoulos, Antonis a ďalší

Predmety: Fully polynomial-time approximation schemes, Subset Sum Ratio, Number Partitioning, Fair division, Envy minimization, Pseudo-polynomial time algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.44

Dostupnosť: https://doi.org/10.4230/LIPIcs.ISAAC.2025.44
https://nbn-resolving.org/urn:nbn:de:0030-drops-249521
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.44

Hyper temporal networks: A tractable generalization of simple temporal networks and its relation to mean payoff games

Autori: Comin, Carlo Posenato, Roberto Rizzi, Romeo a ďalší

Prispievatelia: Comin, Carlo Posenato, Roberto Rizzi, Romeo a ďalší

Zdroj: Constraints. 22:152-190

Predmety: [INFO.INFO-SY] Computer Science [cs]/Systems and Control [cs.SY], FOS: Computer and information sciences, pseudo-polynomial time algorithms, temporal consistency, Computer Science - Artificial Intelligence, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, 01 natural sciences, mean payoff games, hypergraphs, Artificial Intelligence (cs.AI), disjunctive temporal problems, Simple temporal networks, Temporal consistency, Hypergraphs, Pseudo-polynomial time algorithms, Mean-payoff games, Disjunctive temporal problems, Workflows, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, simple temporal networks, workflows, Data Structures and Algorithms (cs.DS), 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1503.03974
http://arxiv.org/abs/1503.03974
http://dblp.uni-trier.de/db/journals/corr/corr1503.html#CominPR15
https://hal-upec-upem.archives-ouvertes.fr/hal-01577455v1
https://hal.inria.fr/hal-01577455v1
http://ui.adsabs.harvard.edu/abs/2015arXiv150303974C/abstract
https://link.springer.com/article/10.1007/s10601-016-9243-0
https://doi.org/10.1007/s10601-016-9243-0

The Fourth International Workshop on Dynamic Scheduling Problems: Extended Abstracts

Autori: Gawiejnowicz, Stanisław (ed.)

Predmety: algorithms, approximation algorithms, competing agents, competitive analysis, data gathering networks, deteriorating jobs, due-dates, dynamic programming, dynamic scheduling, emergency department, fatigue effect, fl ow shop, FPTAS, healthcare, job rejection, just-in-time jobs, learning effect, lot scheduling, lot sizing, LP rounding, maintenance activities, makespan, monotone dynamic programming, NP-hardness, order rejection, parallel machines, position-dependent processing times, precedence constraints, proportionate flow shop, pseudo-polynomial time algorithms

Popis súboru: application/pdf

Relation: https://hdl.handle.net/10593/27487

Dostupnosť: https://hdl.handle.net/10593/27487
https://iwdsp2023.wmi.amu.edu.pl/wp-content/uploads/2023/10/iwdsp2023.pdf
https://doi.org/10.14708/isbn.978-83-962157-1-0

Spread of influence in weighted networks under time and budget constraints

Autori: Cicalese, Ferdinando Cordasco, Gennaro GARGANO, Luisa a ďalší

Zdroj: Theoretical Computer Science. 586:40-58

Predmety: Dynamic monopolies, Exact pseudo-polynomial time algorithms, Social networks, Spread of influence, Viral marketing, Social and Information Networks (cs.SI), FOS: Computer and information sciences, social networks, exact polynomial time algorithm, Computer Science - Social and Information Networks, 0102 computer and information sciences, 02 engineering and technology, dynamic monopolies, 01 natural sciences, spread of influence, viral marketing, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Popis súboru: text/url; application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1502.05599
https://hdl.handle.net/11562/933092
https://doi.org/10.1016/j.tcs.2015.02.032
https://repozitorij.upr.si/IzpisGradiva.php?id=7137
https://hdl.handle.net/20.500.12556/RUP-7137
https://doi.org/10.1016/j.tcs.2015.02.032
https://hdl.handle.net/11386/4604058
https://doi.org/10.1016/j.tcs.2015.02.032
https://hdl.handle.net/11591/199806
https://doi.org/10.1016/j.tcs.2015.02.032

Job selection in a heavily loaded shop

Autori: Ghosh J.B.

Zdroj: Computers and Operations Research

Predmety: Optimization, Morton, Heavily loaded shop, pseudo-polynomial time algorithms, Deterministic scheduling theory in operations research, Heavily Loaded Shop, Approximation theory, Job Selection, NP-hard, Polynomials, Heuristic programming, Computational complexity, Job weights, heavily loaded shop, Job selection, job selection, branch-and-bound, Job analysis, Slotnick, Abstract computational complexity for mathematical programming problems, Algorithms

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: http://repository.bilkent.edu.tr/bitstream/11693/10886/1/1471.pdf
https://zbmath.org/1091597
https://doi.org/10.1016/s0305-0548(96)00045-7
http://repository.bilkent.edu.tr/handle/11693/10886
http://repository.bilkent.edu.tr/bitstream/11693/10886/1/1471.pdf
http://www.sciencedirect.com/science/article/pii/S0305054896000457
https://www.sciencedirect.com/science/article/abs/pii/S0305054896000457
https://dblp.uni-trier.de/db/journals/cor/cor24.html#Ghosh97
https://hdl.handle.net/11693/10886
https://hdl.handle.net/11693/25671

Scheduling to minimize release-time resource consumption and tardiness penalties

Autori: Edward C. Sewell Chung Lun Li T.C.E. Cheng

Zdroj: Naval Research Logistics. 42:949-966

Predmety: single-machine, pseudo-polynomial time algorithms, Deterministic scheduling theory in operations research, 8. Economic growth, common due-date

Popis súboru: application/xml

Prístupová URL adresa: https://research.polyu.edu.hk/en/publications/scheduling-to-minimize-releasetime-resource-consumption-and-tardi

Dynamic programming algorithms for producing food mixture packages by automatic combination weighers

Autori: Shinji IMAHORI Yoshiyuki KARUNO Kenju TATEISHI

Zdroj: Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol 8, Iss 5, Pp JAMDSM0065-JAMDSM0065 (2014)

Predmety: engineering optimization, food packaging, 0-1 integer programming, dynamic programming, pseudo-polynomial time algorithms, Engineering machinery, tools, and implements, TA213-215, Mechanical engineering and machinery, TJ1-1570

Popis súboru: electronic resource

Relation: https://www.jstage.jst.go.jp/article/jamdsm/8/5/8_2014jamdsm0065/_pdf/-char/en; https://doaj.org/toc/1881-3054

Prístupová URL adresa: https://doaj.org/article/ed0eaa0586944afe93103062a2fc9bb9