Da traduttori professionisti, imprese, pagine web e archivi di traduzione disponibili gratuitamente al pubblico.
شاخه و برش (branch and cut) روشی است در بهینه سازی ترکیبیاتی برای حل مسائل برنامههای خطی عدد صحیح، این مسائل، برنامه نویسی خطی هستند که در آنها برخی یا همهٔ مجهولات به مقادیر اعداد صحیح محدود اند.
branch and cut (sometimes written as "branch-and-cut") is a method of combinatorial optimization for solving integer linear programs (ilps), that is, linear programming (lp) problems where some or all the unknowns are restricted to integer values.
Ultimo aggiornamento 2016-03-03
Frequenza di utilizzo: 1
Qualità:
Attenzione: contiene formattazione HTML nascosta
")*[ http://www.rosettacode.org/wiki/knapsack_problem knapsack problem solutions in many languages] at rosetta code*dynamic programming algorithm to 0/1 knapsack problem*0-1 knapsack problem in python*interactive javascript branch-and-bound solver*solving 0-1-knapsack with genetic algorithms in ruby
")*knapsack problem solutions in many languages at rosetta code*dynamic programming algorithm to 0/1 knapsack problem*knapsack problem solver (online)*interactive javascript branch-and-bound solver*solving 0-1-knapsack with genetic algorithms in ruby*codes for quadratic knapsack problem
Ultimo aggiornamento 2016-03-03
Frequenza di utilizzo: 1
Qualità:
Attenzione: contiene formattazione HTML nascosta
Alcuni contributi umani con scarsa rilevanza sono stati nascosti.
Mostra i risultati con scarsa rilevanza.
