Sciweavers

2681 search results - page 16 / 537

» Problem F

110

FOCS
1998
IEEE

118views Theoretical Computer Science» more FOCS 1998»

The Complexity of the Approximation of the Bandwidth Problem

15 years 8 months ago

The Complexity of the Approximation of the Bandwidth Problem

Download www.cs.ust.hk

d Abstract) Walter Unger Lehrstuhl f

Walter Unger

claim paper

Read More »

101

IPCO
2004

94views Optimization» more IPCO 2004»

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

15 years 5 months ago

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Download www.producao.uff.br

Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de A...

claim paper

Read More »

123

Voted

SCL
2008

96views more SCL 2008»

Min-Max MPC based on a network problem

15 years 3 months ago

Min-Max MPC based on a network problem

Download www.esi2.us.es

In general, min

Teodoro Alamo, David Muñoz de la Peñ...

claim paper

Read More »

113

AMC
2005

242views more AMC 2005»

A hybrid method for solving stochastic job shop scheduling problems

15 years 3 months ago

A hybrid method for solving stochastic job shop scheduling problems

Download 4c.ucc.ie

Reza Tavakkoli-Moghaddam, Fariborz Jolai, F. Vazir...

claim paper

Read More »

101

JCT
2007

95views more JCT 2007»

Codegree problems for projective geometries

15 years 3 months ago

Codegree problems for projective geometries

Download www2.gsu.edu

The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...

Peter Keevash, Yi Zhao

claim paper

Read More »

« Prev « First page 16 / 537 Last » Next »