Hi all,

FYI new free software for KSP (Knapsack problem) has been made (written in Python language); it can solve possibly constrained, possibly (with interalg) nonlinear and multiobjective problems with specifiable accuracy.

Along with interalg lots of MILP solvers can be used.

See http://openopt.org/KSP for details.

(updated) See http://openopt.org/BPP for bin packing problem

Regards, Dmitrey.

asked 12 Jul '13, 13:51

Dmitrey's gravatar image

Dmitrey
28311126
accept rate: 0%

edited 30 Aug '13, 05:13

fbahr's gravatar image

fbahr ♦
4.6k716

What exactly is your question?

(02 Sep '13, 08:59) Juergen_Antes
1

As I remember it was debated some time ago, if we would allow announcements and the consensus was we agreed to allow a reasonable amount of announcements. We have not had problems with this decision IMO.

(02 Sep '13, 09:52) Bo Jensen ♦
1

They should of course be tagged with [ANN], which I see Florian has fixed.

(02 Sep '13, 09:54) Bo Jensen ♦

Thank you for explaining the announcement consensus and [ANN] tagg.

(02 Sep '13, 10:29) Juergen_Antes
Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Tags:

×39
×18
×13
×7

Asked: 12 Jul '13, 13:51

Seen: 2,725 times

Last updated: 02 Sep '13, 13:44

OR-Exchange! Your site for questions, answers, and announcements about operations research.