1. Forum
  2. Usenet
  3. COMP.LANG.PERL.MISC

  • best fit packing

    From George Bouras@21:1/5 to All on Thu Feb 11 10:00:01 2021
    I have to put N boxes to M buckets
    All the M buckets must have about the same utilization

    ( it is actually the elasticsearch shards and the servers )

    Do you any library solving the problem ?

    https://arxiv.org/abs/2012.00511

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From gamo@21:1/5 to All on Thu Feb 11 10:31:01 2021
    El 11/2/21 a las 9:00, George Bouras escribió:
    I have to put N boxes to M buckets
    All the M buckets must have about the same utilization

    ( it is actually the elasticsearch shards and the servers )

    Do you any library solving the problem ?

    https://arxiv.org/abs/2012.00511





    This is a clasical integer linear programming type of problem
    called *transportation problem*. Any transportation problem
    could be expressed as a set of linear inequations

    Objetive function to maximize or minimize

    Subject to:

    [set of inequations of requirements]

    Say the list of integer variables

    Google: lp_solve glpk

    Best.

    Post data: I think that in my web you have an example with lp_solve

    --
    http://gamo.sdf-eu.org/
    perl -E 'say "Press return to continue";'

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From George Bouras@21:1/5 to All on Thu Feb 11 13:34:36 2021
    Post data: I think that in my web you have an example with lp_solve


    thanks , checking .
    eeegh may be I will request a help with with specific data.
    But first I will try.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)