Resultats globals: 1 registres trobats en 0.01 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
15 p, 623.1 KB Worst-case analyses, linear programming and the bin-packing problem / Chan, Lap Mui Ann (The Hong Kong Polytechnic University) ; Simchi-Levi, David (Northwestern University) ; Bramel, Julien (Columbia University)
In this paper we consider the familiar bin-packing problem and its associated set-partitioning formulation. We show that the optimal solution to the bin-packing problem can be no larger than 4/3 Z _LP where Z_LP is the optimal solution value of the linear programming relaxation of the set-partitioning formulation. [...]
1998
Mathematical Programming, vol. 83 n. 2 (1998) p. 213-227  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.