Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets

Authors: Khandeev, Vladimir^Aff8, Neshchadim, Sergey^Aff9

Contributors: Ghosh, Ashish, Editorial Board Member^Aff1, Zhou, Lizhu, Editorial Board Member^Aff2, Eremeev, Anton, editor^Aff3, Khachay, Michael, editor^Aff4, Kochetov, Yury, editor^Aff5, Mazalov, Vladimir, editor^Aff6, Pardalos, Panos, editor^Aff7

Source: Mathematical Optimization Theory and Operations Research: Recent Trends : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30 – July 6, 2024, Revised Selected Papers. 2239:319-333

Alternative definition of the strong NP-completeness ; Альтернативное определение NP-полноты в сильном смысле

Authors: Ya. M. Shafransky, Я. М. Шафранский

Source: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series; Том 60, № 4 (2024); 303-308 ; Известия Национальной академии наук Беларуси. Серия физико-математических наук; Том 60, № 4 (2024); 303-308 ; 2524-2415 ; 1561-2430 ; 10.29235/1561-2430-2024-60-4

Subject Terms: NP-полнота в сильном смысле, pseudo-polynomial algorithm, class NP, NP-completeness, strong NP-completeness, псевдополиномиальный алгоритм, класс NP, NP-полнота

File Description: application/pdf

Relation: https://vestifm.belnauka.by/jour/article/view/810/618; Garey, M. R. “Strong” NP-completeness results: motivation, examples, and implications / M. R. Garey, D. S. Johnson // J. Ass. Comput. Machinery. – 1978. – Vol. 25, № 3. – P. 499–508. https://doi.org/10.1145/322077.322090; Garey, M. R. Computers and Intractability. A Guide to the Theory of NP-completeness / M. R. Garey, D. S. Johnson. – New York: W. H. Freeman and Company, 1979. – 348 p.; Webster, S. Note on “Parallel Machine Scheduling with Batch Setup Times” / S. Webster // Oper. Res. – 1998. – Vol. 46, № 3. – P. 423. https://doi.org/10.1287/opre.46.3.423; Shafransky, Y. M. On some contradictions in theory of computational complexity / Y. M. Shafransky // Third Workshop on Models and Algorithms for Planning and Scheduling. – Cambridge, 1997. – P. 42.; https://vestifm.belnauka.by/jour/article/view/810

Availability: https://vestifm.belnauka.by/jour/article/view/810
https://doi.org/10.29235/1561-2430-2024-60-4-303-308

Efficient Index-Based Regular Expression Matching with Optimal Query Plan Tree

Authors: Qiu, Tao^Aff15, Yang, Xiaochun^Aff16, Wang, Bin^Aff16, Zong, Chuanyu^Aff15, Zhu, Rui^Aff15, Xia, Xiufeng^Aff15

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Wang, Xin, editor^Aff7, Sapino, Maria Luisa, editor^Aff8, Han, Wook-Shin, editor^Aff9, El Abbadi, Amr, editor^Aff10, Dobbie, Gill, editor^Aff11, Feng, Zhiyong, editor^Aff12, Shao, Yingxiao, editor^Aff13, Yin, Hongzhi, editor^Aff14

Source: Database Systems for Advanced Applications : 28th International Conference, DASFAA 2023, Tianjin, China, April 17–20, 2023, Proceedings, Part I. 13943:35-45

Single-machine scheduling of multiple projects with controllable processing times

Authors: Geng, Zhichao, Yuan, Jinjiang ^⁎

Source: In European Journal of Operational Research 1 August 2023 308(3):1074-1090

A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs

Authors: Bunn, Kevin A., Ventura, José A. ^⁎

Source: In European Journal of Operational Research 16 May 2023 307(1):116-129

How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs

Authors: Ageev, Alexander^Aff22, Gimadi, Edward^{Aff22, Aff23}, Shtepa, Alexandr^Aff23

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Burnaev, Evgeny, editor^Aff7, Ignatov, Dmitry I., editor^Aff8, Ivanov, Sergei, editor^Aff9, Khachay, Michael, editor^Aff10, Koltsova, Olessia, editor^Aff11, Kutuzov, Andrei, editor^Aff12, Kuznetsov, Sergei O., editor^Aff13, Loukachevitch, Natalia, editor^Aff14, Napoli, Amedeo, editor^Aff15, Panchenko, Alexander, editor^Aff16, Pardalos, Panos M., editor^Aff17, Saramäki, Jari, editor^Aff18, Savchenko, Andrey V., editor^Aff19, Tsymbalov, Evgenii, editor^Aff20, Tutubalina, Elena, editor^Aff21

Source: Analysis of Images, Social Networks and Texts : 10th International Conference, AIST 2021, Tbilisi, Georgia, December 16–18, 2021, Revised Selected Papers. 13217:303-314

An Efficient Real-Time Algorithm for Placing Electronic Components on Panel

Authors: Huyghe, Catherine, Negre, Stephane, Fontaine, Melanie

Contributors: Modélisation, Information et Systèmes - UR UPJV 4290 (MIS), Université de Picardie Jules Verne (UPJV), Eco-Procédés Optimisation et Aide à la Décision - UR UPJV 4669 (EPROAD), Laboratoire des technologies innovantes - UR UPJV 3899 (LTI)

Source: ISSN: 1790-0832.

Subject Terms: bin packing problem, heuristic, dynamical programming algorithm, pseudo-polynomial algorithm, lower bound, operational research, combinatorial problem, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Availability: https://hal.science/hal-04532124
https://hal.science/hal-04532124v1/document
https://hal.science/hal-04532124v1/file/WSEAS2024.pdf
https://doi.org/10.37394/23209.2024.21.14

Single-machine scheduling with an external resource

Authors: Briskorn, Dirk, Davari, Morteza, Matuschke, Jannik

Source: European Journal of Operational Research. 293:457-468

Subject Terms: FOS: Computer and information sciences, Technology, Operations Research, Discrete Mathematics (cs.DM), BOUNDS, 0211 other engineering and technologies, Social Sciences, Pseudo-polynomial algorithm, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 46 Information and computing sciences, 01 natural sciences, Business & Economics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), RENTING PROBLEM, 40 Engineering, Science & Technology, Scheduling, SUBJECT, Operations Research & Management Science, Complexity, Single-machine scheduling, Management, Computer Science - Computational Complexity, External resource, 8. Economic growth, 49 Mathematical sciences, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/pdf/2006.03399
http://arxiv.org/abs/2006.03399
http://ui.adsabs.harvard.edu/abs/2020arXiv200603399B/abstract
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-03399
https://dblp.uni-trier.de/db/journals/eor/eor293.html#BriskornDM21
https://doi.org/10.1016/j.ejor.2020.12.045
https://arxiv.org/pdf/2006.03399
https://www.sciencedirect.com/science/article/pii/S0377221720310912
https://lirias.kuleuven.be/handle/123456789/666234
https://doi.org/10.1016/j.ejor.2020.12.045

Approximations for Restrictions of The Budgeted and Generalized Maximum Coverage Problems

Authors: Piva, Breno ¹

Source: In Electronic Notes in Theoretical Computer Science 30 August 2019 346:667-676

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

Authors: Boros, Endre ^a, Elbassioni, Khaled ^{b, ⁎}, Gurvich, Vladimir ^c, Makino, Kazuhisa ^d

Source: In Information and Computation August 2019 267:74-95

Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

Authors: Henning, Sören^Aff15, Jansen, Klaus^Aff15, Rau, Malin^Aff15, Schmarje, Lars^Aff15

Contributors: Hutchison, David, Series Editor^Aff1, Kanade, Takeo, Series Editor^Aff2, Kittler, Josef, Series Editor^Aff3, Kleinberg, Jon M., Series Editor^Aff4, Mattern, Friedemann, Series Editor^Aff5, Mitchell, John C., Series Editor^Aff6, Naor, Moni, Series Editor^Aff7, Pandu Rangan, C., Series Editor^Aff8, Steffen, Bernhard, Series Editor^Aff9, Terzopoulos, Demetri, Series Editor^Aff10, Tygar, Doug, Series Editor^Aff11, Weikum, Gerhard, Series Editor^Aff12, Fomin, Fedor V., editor^Aff13, Podolskii, Vladimir V., editor^Aff14

Source: Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings. 10846:169-180

INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES

Authors: Sahakyan, Albert Kh., Kamalian, Rafayel R.

Source: Proceedings of the YSU A: Physical and Mathematical Sciences; Vol. 55 No. 3 (256) (2021); 160-168 ; ԵՊՀ Գիտական տեղեկագիր․ Ֆիզմաթ գիտություններ; Vol. 55 No. 3 (256) (2021); 160-168 ; ԵՊՀ Գիտական տեղեկագիր. Ֆիզիկա և մաթեմատիկա; Vol. 55 No. 3 (256) (2021); 160-168 ; Ученые записки ЕГУ: физмат науки; Том 55 № 3 (256) (2021); 160-168 ; 2953-7975 ; 1829-1740 ; 10.46991/PYSU:A/2021.55.3

Subject Terms: cactus graphs, trees, interval vertex-coloring, list coloring, dynamic programming, pseudo-polynomial algorithm

File Description: application/pdf

Relation: https://journals.ysu.am/index.php/proceedings-phys-math/article/view/vol55_no3_2021_pp160-168/pdf

Availability: https://journals.ysu.am/index.php/proceedings-phys-math/article/view/vol55_no3_2021_pp160-168
https://doi.org/10.46991/PYSU:A/2021.55.3.160

A convex programming-based algorithm for mean payoff stochastic games with perfect information

Authors: Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

Source: Optimization Letters. :1-14

Approximation schemes for a class of subset selection problems

Authors: Gerhard J. Woeginger, Kirk Pruhs

Source: Lecture Notes in Computer Science ISBN: 9783540212584

Subject Terms: Approximation scheme, Combinatorial optimization, Single Machine, Scheduling theory, Knapsack Problem, 0211 other engineering and technologies, Schedule Problem, Pseudo-polynomial algorithm, 0102 computer and information sciences, 02 engineering and technology, Approximation Scheme, 16. Peace & justice, Approximation algorithm, 01 natural sciences, Theoretical Computer Science, Combinatorial Optimization Problem, METIS-219783, Worst case analysis, FPTAS, Computer Science(all)

Access URL: https://ris.utwente.nl/ws/files/52019593/Pruhs2004Approximation1.pdf
https://research.utwente.nl/en/publications/92dc9a9b-9a37-4e4c-83ef-4c2b32464846
https://doi.org/10.1007/978-3-540-24698-5_24
https://dblp.uni-trier.de/db/journals/tcs/tcs382.html#PruhsW07
https://core.ac.uk/display/82367085
https://rd.springer.com/chapter/10.1007/978-3-540-24698-5_24
https://dl.acm.org/doi/10.1016/j.tcs.2007.03.006
https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2F92dc9a9b-9a37-4e4c-83ef-4c2b32464846
https://link.springer.com/chapter/10.1007/978-3-540-24698-5_24
https://core.ac.uk/display/92048113
https://ris.utwente.nl/ws/files/52019593/Pruhs2004Approximation1.pdf
https://dblp.uni-trier.de/db/conf/latin/latin2004.html#PruhsW04
https://research.utwente.nl/en/publications/approximation-schemes-for-a-class-of-subset-selection-problems
https://link.springer.com/chapter/10.1007/978-3-540-24698-5_24

Inverse Problems of Some NP-Complete Problems

Authors: Huang, Siming^Aff19

Contributors: Hutchison, David, editor^Aff1, Kanade, Takeo, editor^Aff2, Kittler, Josef, editor^Aff3, Kleinberg, Jon M., editor^Aff4, Mattern, Friedemann, editor^Aff5, Mitchell, John C., editor^Aff6, Naor, Moni, editor^Aff7, Nierstrasz, Oscar, editor^Aff8, Pandu Rangan, C., editor^Aff9, Steffen, Bernhard, editor^Aff10, Sudan, Madhu, editor^Aff11, Terzopoulos, Demetri, editor^Aff12, Tygar, Dough, editor^Aff13, Vardi, Moshe Y., editor^Aff14, Weikum, Gerhard, editor^Aff15, Megiddo, Nimrod, editor^Aff16, Xu, Yinfeng, editor^Aff17, Zhu, Binhai, editor^Aff18

Source: Algorithmic Applications in Management : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings. 3521:422-426

Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

Authors: Svetlana A. Kravchenko

Source: Discrete Applied Mathematics. 98:209-217

Subject Terms: job-shop, Deterministic scheduling theory in operations research, Applied Mathematics, 0211 other engineering and technologies, Job-shop, Pseudo-polynomial algorithm, \(NP\)-hard problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, pseudo-polynomial algorithm, Discrete Mathematics and Combinatorics, NP-hard problem, Abstract computational complexity for mathematical programming problems

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/S0166218X99001651#!
https://www.sciencedirect.com/science/article/pii/S0166218X99001651
https://dblp.uni-trier.de/db/journals/dam/dam98.html#Kravchenko00a
https://doi.org/10.1016/S0166-218X(99)00165-1

Stochastic binary problems with simple penalties for capacity constraints violations

Authors: Fortz, Bernard, Labbé, M., Louveaux, F., Poss, M.

Contributors: Graphes et Optimisation Mathématique Bruxelles (GOM), Université libre de Bruxelles (ULB), Cancer et génome: Bioinformatique, biostatistiques et épidémiologie d'un système complexe, Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut Curie Paris -Institut National de la Santé et de la Recherche Médicale (INSERM), Université de Namur Namur (UNamur), Heuristique et Diagnostic des Systèmes Complexes Compiègne (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), This research is supported by an Actions de Recherche Concertées (ARC) project of the Communautéefrançaise de Belgique. Michael Poss is a research fellow of the Fonds pour la Formation à la Recherchedans l’Industrie et dans l’Agriculture (FRIA). Martine Labbé also acknowledges support from 'Ministeriode Ciencia e Innovacion' of Spain through the research project MTM2009-14039-C06.

Source: Mathematical Programming. 138:199-221

Subject Terms: Business & economic sciences, 0211 other engineering and technologies, Branch-and-cut algorithm, Stochastic programming, Quantitative methods in economics & management, Mixed-integer non-linear programming, Pseudo-polynomial algorithm, 02 engineering and technology, Knapsack problem, Méthodes quantitatives en économie & gestion, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], Recherche opérationnelle, Sciences économiques & de gestion

File Description: 1 full-text file(s): application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01255254/file/KnapsackForLabLouvPossMathProg.pdf
https://hdl.handle.net/2268/318178
https://doi.org/10.1007/s10107-012-0520-4

Simultaneous minimization of total completion time and total deviation of job completion times

Authors: Gur Mosheiov

Source: European Journal of Operational Research. 157:296-306

Subject Terms: 0209 industrial biotechnology, Multiple criteria, Deterministic scheduling theory in operations research, Scheduling, 0211 other engineering and technologies, Pseudo-polynomial algorithm, 02 engineering and technology, Single machine, Dynamic programming, Deterministic

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/S0377221703001930
https://ideas.repec.org/a/eee/ejores/v157y2004i2p296-306.html
https://doi.org/10.1016/S0377-2217(03)00193-0
https://econpapers.repec.org/article/eeeejores/v_3a157_3ay_3a2004_3ai_3a2_3ap_3a296-306.htm
https://dblp.uni-trier.de/db/journals/eor/eor157.html#Mosheiov04

Static and dynamic source locations in undirected networks

Authors: Turner, Lara, Groß, Dwi Poetranto, Hamacher, Horst W., Krumke, Sven O.

Source: TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. October 2015 23(3):619-646

Comments on: Static and dynamic source locations in undirected networks

Authors: Carrizosa Priego, Emilio José

Contributors: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa, Universidad de Sevilla. FQM329: Optimización

Source: idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Universidad de Sevilla (US)
idUS: Depósito de Investigación de la Universidad de Sevilla

Subject Terms: 2. Zero hunger, Tree network, Source location problem, Pseudo-polynomial algorithm, Fully polynomial-time approximation scheme, 16. Peace & justice, Dynamic flow, (Minimal) deficient set, Plural cover problem, (Dual) greedy algorithm, Single cover problem, NP-hardness, Linear algorithm, Matroid

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007%2Fs11750-015-0393-9.pdf
https://idus.us.es/handle//11441/107593
https://hdl.handle.net/11441/107593
https://ideas.repec.org/a/spr/topjnl/v23y2015i3p647-649.html
https://idus.us.es/handle/11441/107593
https://link.springer.com/article/10.1007/s11750-015-0393-9
https://econpapers.repec.org/article/sprtopjnl/v_3a23_3ay_3a2015_3ai_3a3_3ap_3a647-649.htm
https://dialnet.unirioja.es/servlet/articulo?codigo=6791037
https://link.springer.com/content/pdf/10.1007%2Fs11750-015-0393-9.pdf