Lattice-based algorithms for number partitioning in the hard phase (Q1926495): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2012.06.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080030999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase diagram for the constrained integer partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp threshold and scaling window for the integer partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A physicist's approach to number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of optimum partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially small bounds on the expected optimum of the partition and subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete anytime algorithm for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Generic Algorithms for Hard Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Equality Constrained Integer Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column basis reduction and decomposable knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve algorithms for the shortest vector problem are practical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of the closest vector problem with preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank

Latest revision as of 01:19, 6 July 2024

scientific article
Language Label Description Also known as
English
Lattice-based algorithms for number partitioning in the hard phase
scientific article

    Statements

    Lattice-based algorithms for number partitioning in the hard phase (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    number partitioning
    0 references
    closest vector problem
    0 references
    basis reduction
    0 references
    MIP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references