Re: algoritm question - how to fit?

Collapse
This topic is closed.
X
X
 
  • Time
  • Show
Clear All
new posts
  • Jeroen Mostert

    #1

    Re: algoritm question - how to fit?

    mesut wrote:
    I would like to know whether someone has a solution or in another word
    a algoritm for this problem.
    >
    When you have a many packaging
    let's say
    pack A,
    pack B,
    Pack C,
    Pack D
    etc.. etc. etc.
    >
    You have pallets
    Palet A
    Palet B
    Palet C
    Palet D
    etc. etc.
    >
    I would like to have a algoritm how many packaging can be on a palet?
    A palet may contain several packaging types.
    >
    let's say:
    Pallet A may contain 4 x Pack A - OR - contain 3 x Pack A and 2 x
    PackB
    >
    This is a variant of the knapsack problem:


    In particular, it's the multiple constrained knapsack problem. This one can
    be solved using integer programming, for which there exist multiple
    packages. It's not an easy problem to solve efficiently.

    --
    J.
  • mesut

    #2
    Re: algoritm question - how to fit?

    Hi Jeroen,

    thank you for the information. Indeed that describes my problem. At
    lease I know where to point the question.
    Could you please tell more about integer programming? I mean please
    explain how much you can...

    I really appreciate your inpunt. I'm sure this is a reel challange for
    a programmer.

    thanks mesut

    Comment

    • Jeroen Mostert

      #3
      Re: algoritm question - how to fit?

      mesut wrote:
      thank you for the information. Indeed that describes my problem. At
      lease I know where to point the question.
      Could you please tell more about integer programming? I mean please
      explain how much you can...
      >
      Well, this is not C# related, it's a general programming topic. Integer
      programming is a specific case of linear programming. A very simple
      description of linear programming would be that it's a way of finding
      maximum values for a set of unknowns subject to constraints. Integer
      programming is a further specialization of that where the solution must be
      all-integers.

      The best way to learn it is in the context of a CS course -- or else with a
      good book. There are lots of LP packages available that will solve LP
      problems for you without additional coding, but learning to use them well
      takes a bit of effort. Wikipedia's topic
      (http://en.wikipedia.org/wiki/Linear_programming) has a large list of
      software at the end, some of which seems to be geared towards study.

      It's been a while since I've had to deal with LP myself. And I suck as a
      teacher, sorry. :-)

      --
      J.

      Comment

      • mesut

        #4
        Re: algoritm question - how to fit?

        thanks Jeroen... yes you are. You're a good teacher. :)
        I've a lot of information to go now thanks..

        cheers, mesut

        Comment

        Working...