Elsevier | Sciweavers

33

ORL
2007

54views more ORL 2007»

A new lower bound for the non-oriented two-dimensional bin-packing problem

14 years 7 days ago

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...

François Clautiaux, Antoine Jouglet, Joseph...

claim paper

Read More »

41

click to vote

COMGEO
2004
ACM

110views Applied Computing» more COMGEO 2004»

A lower bound on the number of triangulations of planar point sets

14 years 18 days ago

Download www.ist.tugraz.at

We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...

Oswin Aichholzer, Ferran Hurtado, Marc Noy

claim paper

Read More »

38

click to vote

JCT
2006

67views more JCT 2006»

On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs

14 years 21 days ago

Download www.tcs.hut.fi

We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...

Malcolm Greig, Harri Haanpää, Petteri Ka...

claim paper

Read More »

34

click to vote

EOR
2006

80views more EOR 2006»

Bucket brigades on in-tree assembly networks

14 years 22 days ago

Download www2.isye.gatech.edu

In a network of subassembly lines, balance becomes more difficult to achieve as it requires that all subassembly lines be synchronized to produce at the same rate. We show how to ...

John J. Bartholdi III, Donald D. Eisenstein, Yun F...

claim paper

Read More »

38

click to vote

AMC
2006

65views more AMC 2006»

Duality in nondifferentiable minimax fractional programming with generalized convexity

14 years 24 days ago

$Duality in nondifferentiable minimax fractional programming with generalized convexity$