Partially ordered sets corresponding to the partition problem

DOI10.1007/978-3-032-04700-7_23MaRDI QIDQ6852210zbMATH OpenFDO

Authors Susumu Kubo

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_23

zbMATH Keywords

combinatorial optimizationpartial orderpartition problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• A complete anytime algorithm for number partitioning
• A new modeling and solution approach for the number partitioning problem
• An algebraic expression of the number partitioning problem
• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• Computing Partitions with Applications to the Knapsack Problem
• Easily searched encodings for number partitioning
• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3390759 (Why is no real title available?)
• On a conjecture of Andrica and Tomescu
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Phase transition and finite-size scaling for the integer partitioning problem
• Phase Transition in the Number Partitioning Problem
• Reducibility among combinatorial problems
• Some applications of algebra to combinatorics
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property

This page was built for publication: Partially ordered sets corresponding to the partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852210)