Search Results - "Polynomial time algorithms"

Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability.

Authors: Akrami, Hannaneh Chaudhury, Bhaskar Ray Hoefer, Martin et al.

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p853-876. 24p.

Scarf's Algorithm and Stable Marriages.

Authors: Faenza, Yuri He, Chengyue Sethuraman, Jay

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1174-1204. 31p.

A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree.

Authors: Angelelli, Enrico Mansini, Renata Rizzi, Romeo

Source: Mathematics of Operations Research (INFORMS). Feb2026, Vol. 51 Issue 1, p476-497. 22p.

Hamiltonian cycle in polynomial time (P=NP).

Authors: kulkarni, Sanket sanketkulpnp@gmail.com

Source: International Scientific Journal of Engineering & Management. Jun2026, Vol. 5 Issue 6, p1-4. 4p.

The Value of Robust Assortment Optimization Under Ranking-Based Choice Models.

Authors: Sturt, Bradley¹ (AUTHOR) bsturt@uic.edu

Source: Management Science (INFORMS). May2025, Vol. 71 Issue 5, p4246-4265. 20p.

Optimizing the half-gcd algorithm.

Authors: van der Hoeven, Joris¹ (AUTHOR) vdhoeven@lix.polytechnique.fr

Source: Applicable Algebra in Engineering, Communication & Computing. Jul2026, Vol. 37 Issue 4, p853-877. 25p.

Strong edge coloring algorithm for K4-minor free graphs.

Authors: van Bommel, M. F. Wang, Ping

Source: Discrete Mathematics, Algorithms & Applications. Jun2026, Vol. 18 Issue 5, p1-10. 10p.

On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms.

Authors: Ketkov, Sergey S. Prokopyev, Oleg A.

Source: INFORMS Journal on Computing; May/Jun2026, Vol. 38 Issue 3, p998-1015, 18p

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets.

Authors: Liu, Bowen Wang, Jiashu Melnikov, Boris

Source: Axioms (2075-1680). May2026, Vol. 15 Issue 5, p337. 26p.

Submodular Functions and Perfect Graphs.

Authors: Abrishami, Tara Chudnovsky, Maria Dibek, Cemil et al.

Source: Mathematics of Operations Research (INFORMS). Feb2025, Vol. 50 Issue 1, p189-208. 20p.

A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.

Authors: Li, Shuguang Wei, Jing Liang, Yanyue et al.

Source: Central European Journal of Operations Research. Mar2026, Vol. 34 Issue 1, p161-181. 21p.

Representations of the Symmetric Group are Decomposable in Polynomial Time.

Authors: Olver, Sheehan¹ (AUTHOR) s.olver@imperial.ac.uk

Source: Foundations of Computational Mathematics. Apr2026, Vol. 26 Issue 2, p1069-1092. 24p.

Subjects: Representation theory, Polynomial time algorithms, Matrix decomposition, Tensor products, Algorithms, Symmetry groups

Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k.

Authors: Beideman, Calvin Chandrasekaran, Karthekeyan Wang, Weihang

Source: Mathematics of Operations Research (INFORMS). Nov2024, Vol. 49 Issue 4, p2579-2601. 23p.

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number.

Authors: Chaudhury, Bhaskar Ray Garg, Jugal Mehlhorn, Kurt et al.

Source: Mathematics of Operations Research (INFORMS). Nov2024, Vol. 49 Issue 4, p2323-2340. 18p.

Fair-Share Allocations for Agents with Arbitrary Entitlements.

Authors: Babaioff, Moshe Ezra, Tomer Feige, Uriel

Source: Mathematics of Operations Research (INFORMS). Nov2024, Vol. 49 Issue 4, p2180-2211. 32p.

Learning in Repeated Multiunit Pay-as-Bid Auctions.

Authors: Galgana, Rigel Golrezaei, Negin

Source: Manufacturing & Service Operations Management (M&SOM) (INFORMS). Jan/Feb2025, Vol. 27 Issue 1, p200-229. 30p.

Optimal Decision Making Under Strategic Behavior.

Authors: Tsirtsis, Stratis Tabibian, Behzad Khajehnejad, Moein et al.

Source: Management Science (INFORMS). Dec2024, Vol. 70 Issue 12, p8506-8519. 14p.

Assortment Optimization Under the Multi-Purchase Multinomial Logit Choice Model.

Authors: Bai, Yicheng Feldman, Jacob Segev, Danny et al.

Source: Operations Research. Nov/Dec2024, Vol. 72 Issue 6, p2631-2664. 34p.

Rescheduling with New Orders Under Bounded Disruption.

Authors: Lendl, Stefan Pferschy, Ulrich Rener, Elena

Source: INFORMS Journal on Computing. Nov/Dec2024, Vol. 36 Issue 6, p1654-1675. 22p.

Complement Reducible Uniform Hypergraphs.

Authors: Gurski, Frank Rethmann, Jochen

Source: Axioms (2075-1680). Apr2026, Vol. 15 Issue 4, p278. 21p.