cutternumberG216c

Calculadora Explorar ¿Qué es el Cutter?

Buscar en el catálogo

Cargando…

cutternumber.com.ar

Número de Cutter-Sanborn y catálogo bibliográfico en español, con millones de obras, ediciones y autores.

Calculadora Cutter Guía de catalogación Explorar el catálogo

Datos bibliográficos de Open Library (Internet Archive). Tabla Cutter-Sanborn de tres cifras.

Inicio
Explorar
Near-optimal bin packing algorithms

NNear-optimal bin packing algorithms

Número de Cutter-SanbornJ66nEntrada «Johnso» → 66 · marca de obra “n”

Near-optimal bin packing algorithms

de David S. Johnson

Materias

Combinatorial packing and covering
Data processing

Ediciones (1)

Near-optimal bin packing algorithms (1973)
Massachusetts Institute of Technology · inglés

Más obras de David S. Johnson

TThe shortest path problem

The shortest path problem

Tapa de Network flows and matching

Network flows and matching

Tapa de Data structures, near neighbor searches, and methodology

Data structures, near neighbor searches, and methodology

Near-optimal bin packing algorithms — David S. Johnson | Cutter Number

Tapa de Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Tapa de Discrete algorithms and complexity

Discrete algorithms and complexity

Tapa de Computers and intractability

Computers and intractability

Ver todas las obras de David S. Johnson →