A lexicographically implicit enumeration algorithm for the binary knapsack problem.
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Libro |
| Lenguaje: | inglés |
| Publicado: |
Fribourg (Suisse)
1975
|
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Order eBook: |
|
| Order Book: | Login to order |
Ejemplares similares: A lexicographically implicit enumeration algorithm for the binary knapsack problem.
- Ganzzahlige lineare Programmierung und das Knapsack-Problem.
- Enumerability, decidability, computability
- Aggregation of binary relations : algorithmic and polyhedral investigations
- The sanskrit indeclinables of the Hindu grammarians and lexicographers
- Greek lexicographical Notes. A critical suppl. to the Greek-English lexicon of Liddell-Scott-Jones
- Enumerability, decidability, computability [Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit. Engl.]. An introd. to the theory of recursive functions