Search Results - analysis of algorithms and (problem OR problems) complexity

Symmetries in constraint satisfaction: Weisfeiler-Leman invariance and promise problems

Authors: Butti, Silvia

Contributors: University/Department: Universitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions

Thesis Advisors: Dalmau, Víctor

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: Constraint satisfaction problems, Linear programming, Weisfeiler-Leman algorithm, Sherali-Adams hierarchy, Distributed algorithms, Model checking, Problema de satisfacción de restricciones, Programación lineal, Algoritmo de Weisfeiler-Leman, Jerarquía de Sherali-Adams, Algoritmos distribuidos, Verificación de modelos, Problema de satisfacció de restriccions, Programació lineal, Algoritme de Weisfeiler-Leman, Jerarquia de Sherali-Adams, Algorismes distribuïts, Verificació de models

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/675788

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG

Authors: Cáceres, Manuel Mumey, Brendan Husić, Edin et al.

Source: IEEE/ACM Transactions on Computational Biology & Bioinformatics. 19(6):3673-3684

Subject Terms: Graph algorithms, Network problems, Analysis of Algorithms and Problem Complexity, Biology and genetics, datalogi, Computer Science

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751
https://doi.org/10.1109/tcbb.2021.3131203

Maximum Commonality Problems: Applications and Analysis

Authors: Dawande, Milind Kumar, Subodha Mookerjee, Vijay et al.

Source: Management Science, 2008 Jan 01. 54(1), 194-207.

Access URL: https://www.jstor.org/stable/20122370

Complexity and Algorithms for Graph and Hypergraph Sandwich Problems: Complexity and algorithms for graph and hypergraph sandwich problems

Authors: Martin Charles Golumbic Amir Wassermann

Source: Graphs and Combinatorics. 14:223-239

Subject Terms: Graphs and linear algebra (matrices, eigenvalues, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, 0102 computer and information sciences, 0101 mathematics, Hypergraphs, 01 natural sciences, hypergraph sandwich problem

File Description: application/xml

Access URL: https://zbmath.org/1211724
https://doi.org/10.1007/s003730050028
https://dblp.uni-trier.de/db/journals/gc/gc14.html#GolumbicW98
https://link.springer.com/article/10.1007/s003730050028

Average Case Subquadratic Exact and Heuristic Procedures for the Traveling Salesman 2-OPT Neighborhood.

Authors: Lancia, Giuseppe Vidoni, Paolo

Source: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1202-1222, 21p

Subject Terms: TRAVELING salesman problem, HEURISTIC, DETERMINISTIC algorithms, GRAPH theory, COMPUTATIONAL complexity, EMPIRICAL research

The point-to-point delivery and connection problems: complexity and algorithms: The point-to-point delivery and connection problems: Complexity and algorithms

Authors: Chung Lun Li David Simchi-Levi S. Thomas McCormick

Source: Discrete Applied Mathematics. 36:267-292

Subject Terms: Network design and communication in computer systems, point-to-point connection problems, Analysis of algorithms and problem complexity, Applied Mathematics, strongly NP-hard, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, point-to-point delivery problems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/journals/dam/dam36.html#LiMS92
https://www.sciencedirect.com/science/article/abs/pii/0166218X9290258C
https://www.sciencedirect.com/science/article/pii/0166218X9290258C
https://api.elsevier.com/content/article/PII:0166218X9290258C?httpAccept=text/xml

On some multicriteria arborescence problems: Complexity and algorithms

Authors: DELL'AMICO, Mauro MAFFIOLI F.

Source: Discrete Applied Mathematics. 65:191-206

Subject Terms: Arborescence, Computational Complexity, Multicriteria, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, digraph

File Description: application/xml

Access URL: https://zbmath.org/897380
https://doi.org/10.1016/0166-218x(95)00035-p
https://www.sciencedirect.com/science/article/pii/0166218X9500035P
https://iris.unimore.it/handle/11380/451178
https://doi.org/10.1016/0166-218X(95)00035-P
https://dblp.uni-trier.de/db/journals/dam/dam65.html#DellAmicoM96
https://hdl.handle.net/11380/451178

An Improved Combinatorial Benders Decomposition Algorithm for the Human-Robot Collaborative Assembly Line Balancing Problem.

Authors: Huang, Dian Mao, Zhaofang Fang, Kan et al.

Source: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1267-1283, 17p

Subject Terms: ASSEMBLY line balancing, COMBINATORIAL optimization, PROBLEM solving, ALGORITHMS, FLEXIBLE manufacturing systems, EMPIRICAL research, HUMAN-robot interaction, MIXED integer linear programming

Predicting Data Science Performance from Log Data: Using Machine Learning

Authors: Tenzin Doleck Pedram Agand Dylan Pirrotta

Source: Education and Information Technologies. 2025 30(10):14561-14575.

Peer Reviewed: Y

Page Count: 15

Descriptors: Prediction, Data Science, Performance, Data Analysis, Artificial Intelligence, Statistics Education, Algorithms, Problem Solving, Accuracy

A study on structure recovery and the broadcasting problem

Authors: Velona, Vasiliki

Contributors: University/Department: Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística

Thesis Advisors: Lugosi, Gábor, Rué Perna, Juan José

Source: TDX (Tesis Doctorals en Xarxa)

Subject Terms: Àrees temàtiques de la UPC::Matemàtiques i estadística

File Description: application/pdf

Access URL: http://hdl.handle.net/10803/672697
https://dx.doi.org/10.5821/dissertation-2117-355670

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints.

Authors: Nip, Kameng Wang, Zhenbo

Source: Journal of Scheduling; Dec2023, Vol. 26 Issue 6, p543-558, 16p

Subject Terms: FLOW shop scheduling, PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION algorithms, ALGORITHMS, SCHEDULING, FLOW shops, WORKING hours, SHIFT systems

Accuracy Certificates for Computational Problems with Convex Structure

Authors: Nemirovski, Arkadi Onn, Shmuel Rothblum, Uriel G.

Source: Mathematics of Operations Research, 2010 Feb 01. 35(1), 52-78.

Access URL: https://www.jstor.org/stable/40538417

Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems.

Authors: Helfrich, Stephan Ruzika, Stefan Thielen, Clemens

Source: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1223-1241, 19p

Subject Terms: MULTI-objective optimization, CONVEX sets, KNAPSACK problems, APPROXIMATION error, POLYNOMIAL time algorithms, ALGORITHMS, COMBINATORIAL optimization

The economic lot-sizing problem with remanufacturing and heterogeneous returns: formulations, analysis and algorithms.

Authors: Piñeyro, Pedro Viera, Omar

Source: International Journal of Production Research; Jun2022, Vol. 60 Issue 11, p3521-3533, 13p, 3 Charts, 2 Graphs

Subject Terms: REMANUFACTURING, INVENTORY costs, DYNAMIC programming, NP-hard problems, COST functions, POLYNOMIAL time algorithms

The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph.

Authors: Yamín, Daniel Desaulniers, Guy Mendoza, Jorge E.

Source: INFORMS Journal on Computing; Jul/Aug2025, Vol. 37 Issue 4, p808-830, 23p

Subject Terms: ELECTRIC vehicles, VEHICLE routing problem, RESOURCE management, NUMERICAL calculations, ELECTRIC vehicle industry, OPTIMIZATION algorithms, MULTIGRAPH, MATHEMATICAL optimization

Complexity of Nilpotent Unification and Matching Problems: Complexity of nilpotent unification and matching problems.

Authors: Guo, Qing Narendran, Paliath Wolfram, David

Source: Information and Computation. 162:3-23

Subject Terms: Problem solving, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, Polynomials, 01 natural sciences, Theoretical Computer Science, Computer Science Applications, Computational complexity, Matching problems, Mechanization of proofs and logical operations, Computational Theory and Mathematics, Keywords: Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Set theory, Linear equations, equational unification, Pattern matching, Theorem proving (deduction, resolution, etc.), Information Systems

File Description: application/xml

Access URL: https://digitalcollections.anu.edu.au/handle/1885/89088
https://dblp.uni-trier.de/db/journals/iandc/iandc162.html#GuoNW00
https://www.sciencedirect.com/science/article/pii/S0890540199928493
https://openresearch-repository.anu.edu.au/handle/1885/89088
https://core.ac.uk/display/82266128

Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem.

Authors: Basciftci, Beste Ahmed, Shabbir Gebraeel, Nagi

Source: Manufacturing & Service Operations Management (M&SOM); Nov/Dec2024, Vol. 26 Issue 6, p2121-2141, 21p

Subject Terms: STOCHASTIC programming, STOCHASTIC analysis, RENEWABLE energy sources, APPROXIMATION algorithms, HEURISTIC algorithms

Solution of discrete time–cost trade-off problem with adaptive search domain.

Authors: Bettemir, Önder Halis Birgonul, M. Talat

Source: Engineering Construction & Architectural Management (09699988); 2025, Vol. 32 Issue 2, p1032-1052, 21p

Subject Terms: HEURISTIC algorithms, SEARCH algorithms, CONSTRUCTION costs, CONSTRUCTION projects, ALGORITHMS, METAHEURISTIC algorithms, DIFFERENTIAL evolution

Complexity of Product Positioning and Ball Intersection Problems: Complexity of product positioning and ball intersection problems

Authors: Crama, Yves Hansen, Pierre Jaumard, Brigitte

Source: Mathematics of Operations Research. 20:885-894

Subject Terms: location theory, Business & economic sciences, Applications of mathematical programming, Discrete location and assignment, intersection graph, Analysis of algorithms and problem complexity, Marketing, advertising, product positioning problem, Quantitative methods in economics & management, product positioning, ball intersection, Sciences économiques & de gestion, Méthodes quantitatives en économie & gestion

File Description: application/xml

Access URL: https://pubsonline.informs.org/doi/abs/10.1287/moor.20.4.885
https://EconPapers.repec.org/RePEc:inm:ormoor:v:20:y:1995:i:4:p:885-894
https://ideas.repec.org/a/inm/ormoor/v20y1995i4p885-894.html
https://orbi.uliege.be/handle/2268/203415
https://core.ac.uk/display/73897245
https://hdl.handle.net/2268/203415
https://doi.org/10.1287/moor.20.4.885

Complexity of Generalized Satisfiability Counting Problems: Complexity of generalized satisfiability counting problems

Authors: Nadia Creignou Miki Hermann

Source: Information and Computation. 125:1-12

Subject Terms: Computational Theory and Mathematics, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, satisfiability problems, 01 natural sciences, Theoretical Computer Science, Information Systems, Computer Science Applications

File Description: application/xml

Access URL: https://zbmath.org/896632
https://doi.org/10.1006/inco.1996.0016
https://www.sciencedirect.com/science/article/abs/pii/S0890540196900164
https://dblp.uni-trier.de/db/journals/iandc/iandc125.html#CreignouH96
https://core.ac.uk/display/82741030
https://www.sciencedirect.com/science/article/pii/S0890540196900164