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

A reliable framework for supply chain management using cluster based blockchain for intelligent industrial automation

Autori: Eesa Alsolami Mahmoud Ahmad Al-khasawenh Ala Abdulsalam Alarood a ďalší

Zdroj: Scientific Reports, Vol 15, Iss 1, Pp 1-18 (2025)

Predmety: Intelligent manufacturing system, Industrial automation, Reliable supply chain management, Adversary model, Probability polynomial time algorithm, Medicine, Science

Popis súboru: electronic resource

Relation: https://doaj.org/toc/2045-2322

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

A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph

Autori: Muhammad Tlas

Zdroj: Network Biology, Vol 15, Iss 2, Pp 48-66 (2025)

Predmety: maximum flow problem, scaling algorithm, polynomial time algorithm, augmenting path method, network flow, digraph, Biology (General), QH301-705.5

Popis súboru: electronic resource

Relation: http://www.iaees.org/publications/journals/nb/articles/2025-15(2)/a-bit-arc-capacity-scaling-algorithm.pdf; https://doaj.org/toc/2220-8879

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

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

Autori: Barbato, Michele Ceselli, Alberto Righini, Giovanni

Zdroj: Journal of Scheduling. 27:393-407

Predmety: Combinatorial optimization, Crane scheduling, Dynamic programming, Polynomial-time algorithm, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology

Popis súboru: application/pdf

Polynomial-time Tractable Problems over the $p$-adic Numbers

Autori: Bodirsky, Manuel Fehm, Arno Manuel Bodirsky and Arno Fehm

Prispievatelia: Bodirsky, Manuel Fehm, Arno Manuel Bodirsky and Arno Fehm

Predmety: linear theory, FOS: Computer and information sciences, constraint satisfaction, polynomial-time algorithm, Mathematics - Logic, p-adic numbers, Computational Complexity (cs.CC), F.4.1, F.2.1, existential theory, Computer Science - Computational Complexity, NP-hardness, FOS: Mathematics, linear program feasibility, ddc:004, Logic (math.LO)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.13536
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.25

Polynomial-Time Tractable Problems over the p-Adic Numbers

Autori: Bodirsky, Manuel Fehm, Arno Manuel Bodirsky and Arno Fehm

Prispievatelia: Bodirsky, Manuel Fehm, Arno Manuel Bodirsky and Arno Fehm

Predmety: p-adic numbers, existential theory, linear theory, constraint satisfaction, linear program feasibility, NP-hardness, polynomial-time algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 345, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.25

Dostupnosť: https://doi.org/10.4230/LIPIcs.MFCS.2025.25
https://nbn-resolving.org/urn:nbn:de:0030-drops-241325
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.25

Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs

Autori: Schaller, David Geiß, Manuela Stadler, Peter F. a ďalší

Zdroj: Journal of Mathematical Biology. 82(20)

Predmety: Orthology detection, Best matches, Unambiguous orthologs, Colored graphs, Cograph, Tree reconciliation, Polynomial-time algorithm

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-192155
https://doi.org/10.1007/s00285-021-01564-8

Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs

Autori: Schaller, David Geiß, Manuela Hellmuth, Marc a ďalší

Zdroj: Algorithms. 14(4)

Predmety: best matches, least resolved trees, graph completion, polynomial-time algorithm

Popis súboru: electronic

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-192159
https://doi.org/10.3390/a14040110

On Karmakar's Algorithm for Linear Programming

Autori: R.N. Yadav R.P., Chaurasiya D.K., Yadav

Predmety: linear convergence, linear programming, polynomial-time algorithm, speed of convergence, super linear convergence

Relation: https://zenodo.org/records/16785173; oai:zenodo.org:16785173; https://doi.org/10.5281/zenodo.16785173

Dostupnosť: https://doi.org/10.5281/zenodo.16785173
https://zenodo.org/records/16785173

Lot sizing with capacity adjustment using on-site green and grid electricity

Autori: Akbalik, Ayse Gicquel, Céline Penz, Bernard a ďalší

Prispievatelia: Akbalik, Ayse Gicquel, Céline Penz, Bernard a ďalší

Zdroj: ISSN: 0305-0483 ; Omega ; https://hal.science/hal-04887456 ; Omega, 2025, 133, pp.103260. ⟨10.1016/j.omega.2024.103260⟩.

Predmety: Energy-flexible production, Lot-sizing problem, Capacity planning, Renewable energy, Polynomial time algorithm, Complexity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://hal.science/hal-04887456
https://hal.science/hal-04887456v1/document
https://hal.science/hal-04887456v1/file/Akbaliketal_Omega2024.pdf
https://doi.org/10.1016/j.omega.2024.103260

Adapting stable matchings to forced and forbidden pairs

Autori: Boehmer, Niclas Heeger, Klaus

Predmety: 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, stable marriage, stable roommates, forced and forbidden pairs, incremental algorithms, rotations, NP-hardness, polynomial-time algorithm, W[1]-hardness, FPT

Popis súboru: application/pdf

Dostupnosť: https://depositonce.tu-berlin.de/handle/11303/24988
https://doi.org/10.14279/depositonce-23804

The complexity of transitively orienting temporal graphs

Autori: Mertzios, George B. Molter, Hendrik Renken, Malte a ďalší

Prispievatelia: Mertzios, George B. Molter, Hendrik Renken, Malte a ďalší

Zdroj: Leibniz International Proceedings in Informatics, LIPIcs
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Tallinn, Estonia, 23-27 Aug 2021 [Conference proceedings]
Journal of Computer and System Sciences

Predmety: FOS: Computer and information sciences, Temporal graph, Discrete Mathematics (cs.DM), polynomial-time algorithm, 0102 computer and information sciences, Computational Complexity (cs.CC), transitive orientation, 01 natural sciences, transitive closure, Computer Science - Computational Complexity, satisfiability, Computer Science - Data Structures and Algorithms, NP-hardness, Data Structures and Algorithms (cs.DS), ddc:004, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2102.06783
http://livrepository.liverpool.ac.uk/3139714/1/MFCS_2021_paper_113.pdf
https://drops.dagstuhl.de/opus/volltexte/2021/14515/
https://drops.dagstuhl.de/opus/volltexte/2021/14515/pdf/LIPIcs-MFCS-2021-75.pdf/
http://dro.dur.ac.uk/33335/
https://arxiv.org/abs/2102.06783
https://arxiv.org/pdf/2102.06783
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-06783
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.75
http://dro.dur.ac.uk/33335/
http://dro.dur.ac.uk/33335/1/33335.pdf
http://dro.dur.ac.uk/33335/2/33335VoR.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2021.75

Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems

Autori: Wei Wu Takito Hayashi Kato Haruyasu a ďalší

Zdroj: European Journal of Operational Research. 307:82-102

Predmety: Deterministic scheduling theory in operations research, polynomial-time algorithm, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, robust optimization, scheduling, batch scheduling, 02 engineering and technology, shortest path problem

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/7705803
https://doi.org/10.1016/j.ejor.2022.09.032

Best Match Graphs With Binary Trees

Autori: David Schaller Manuela Geiß Marc Hellmuth a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783030744311

Predmety: FOS: Computer and information sciences, 0301 basic medicine, History, Discrete Mathematics (cs.DM), Bioinformatics, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Image color analysis, Polynomial-time algorithm, 03 medical and health sciences, 106005 Bioinformatik, Computer Science - Data Structures and Algorithms, NP-hardness, binary trees, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), integer linear program, Quantitative Biology - Populations and Evolution, Phylogeny, Vegetation, Integer Linear Program, polynomial-time algorithm, Populations and Evolution (q-bio.PE), Best match graphs, Genomics, Programming, Linear, Binary trees, rooted triple consistency, Rooted triple consistency, Computer Science - Computational Complexity, FOS: Biological sciences, Combinatorics (math.CO), 106005 Bioinformatics, Algorithms, Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/pdf/2011.00511
https://pubmed.ncbi.nlm.nih.gov/35044918
http://arxiv.org/abs/2011.00511
https://ucrisportal.univie.ac.at/de/publications/65ae17ae-0532-452b-9951-fef6c839b1b2
https://doi.org/10.1109/TCBB.2022.3143870
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-00511
https://link.springer.com/chapter/10.1007/978-3-030-74432-8_6

Basis sequence reconfiguration in the union of matroids

Autori: Hanaka, Tesshu Iwamasa, Yuni Kobayashi, Yasuaki a ďalší

Prispievatelia: Hanaka, Tesshu Iwamasa, Yuni Kobayashi, Yasuaki a ďalší

Predmety: Matroids, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), ddc:004, Combinatorial reconfiguration, Polynomial-time algorithm, Inapproximability, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2409.07848
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.38

A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique

Autori: Muhammad Tlas

Zdroj: Network Biology, Vol 13, Iss 4, Pp 122-136 (2023)

Predmety: maximum flow problem, bit-capacity scaling algorithm, polynomial time algorithm, augmenting path method, network flow, Biology (General), QH301-705.5

Popis súboru: electronic resource

Relation: http://www.iaees.org/publications/journals/nb/articles/2023-13(4)/maximal-constrained-network-flow-problem.pdf; https://doaj.org/toc/2220-8879

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

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs

Autori: Del Pia, Alberto Di Gregorio, Silvia

Zdroj: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977073

Predmety: ddc:510, ddc:004, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Binäre polynomielle Optimierung, Algorithmus mit stark polynomialer Zeit, Azyklische Hypergraphen, Härte der Approximation, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Binary polynomial optimization, Strongly polynomial-time algorithm, Acyclic hypergraphs, Hardness of approximation, Optimization and Control (math.OC), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/pdf/2007.05861
http://arxiv.org/abs/2007.05861
https://tud.qucosa.de/api/qucosa:89201/attachment/ATT-0/
https://tud.qucosa.de/id/qucosa:89201

The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences

Autori: Minna Hirvonen Department of Mathematics and Statistics Varzinczak, Ivan

Prispievatelia: Minna Hirvonen Department of Mathematics and Statistics Varzinczak, Ivan

Zdroj: Lecture Notes in Computer Science ISBN: 9783031113208

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Complete axiomatization, Functional dependence, Computer and information sciences, Armstrong relations, Marginal distribution equivalence, Probabilistic team semantics, Polynomial-time algorithm, Mathematics, Logic in Computer Science (cs.LO)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2312.03579
http://hdl.handle.net/10138/590544
http://hdl.handle.net/10138/563002

Strong Cliques in Diamond-Free Graphs

Autori: Nina Chiarelli Berenice Martínez-Barona Martin Milanič a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783030604394

Predmety: CIS graph, Strong clique, NP-težek problem, strong clique, strongly perfect graph, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, algoritem linearne časovne zahtevnosti, 01 natural sciences, Polynomial-time algorithm, krepko popoln graf, Principes généraux des mathématiques, Diamond-free graph, Simplicial clique, lastnost Erdősa in Hajnala, FOS: Mathematics, Mathematics - Combinatorics, Maximal clique, simplicialna klika, maximal stable set, Maximal stable set, Erdős-Hajnal property, graf brez diamantov, maksimalna klika, polynomial-time algorithm, krepka klika, Strongly perfect graph, CIS graf, maximal clique, simplicial clique, diamond-free graph, linear-time algorithm, polinomski algoritem, maksimalna neodvisna množica, NP-hard problem, Combinatorics (math.CO)

Popis súboru: text/url

Prístupová URL adresa: http://arxiv.org/pdf/2006.13822
http://arxiv.org/abs/2006.13822
https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_21
https://www.sciencedirect.com/science/article/pii/S0304397520307088
https://rd.springer.com/chapter/10.1007/978-3-030-60440-0_21
https://repozitorij.upr.si/IzpisGradiva.php?id=14263&lang=slv
https://dblp.uni-trier.de/db/journals/tcs/tcs858.html#ChiarelliMMMM21
https://hdl.handle.net/20.500.12556/RUP-14263
https://repozitorij.upr.si/IzpisGradiva.php?id=14263
https://doi.org/10.1007/978-3-030-60440-0_21

Single-machine scheduling with machine unavailability periods and resource dependent processing times

Autori: Dvir Shabtay

Zdroj: European Journal of Operational Research. 296:423-439

Predmety: controllable processing time, machine unavailability period, Deterministic scheduling theory in operations research, single-machine scheduling, pseudo polynomial time algorithm, 0211 other engineering and technologies, resource allocation, 02 engineering and technology, approximation algorithms, 12. Responsible consumption

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/7422936
https://doi.org/10.1016/j.ejor.2021.03.034
https://www.sciencedirect.com/science/article/pii/S0377221721002605
https://doi.org/10.1016/j.ejor.2021.03.034
https://dblp.uni-trier.de/db/journals/eor/eor296.html#Shabtay22

Solving problems on generalized convex graphs via mim-width

Autori: Bonomo-Braberman F. Brettell N. Munaro A. a ďalší

Prispievatelia: Bonomo-Braberman F. Brettell N. Munaro A. a ďalší

Predmety: Convex graph, Mim-width, Polynomial-time algorithm, Width parameter, Settore INFO-01/A - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001114927300001; volume:140; journal:JOURNAL OF COMPUTER AND SYSTEM SCIENCES; https://hdl.handle.net/11381/2965393

Dostupnosť: https://hdl.handle.net/11381/2965393
https://doi.org/10.1016/j.jcss.2023.103493