Sciweavers

2681 search results - page 16 / 537
» Problem F
Sort
View
FOCS
1998
IEEE
14 years 1 months ago
The Complexity of the Approximation of the Bandwidth Problem
d Abstract) Walter Unger Lehrstuhl f
Walter Unger
IPCO
2004
94views Optimization» more  IPCO 2004»
13 years 10 months ago
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de A...
SCL
2008
96views more  SCL 2008»
13 years 8 months ago
Min-Max MPC based on a network problem
In general, min
Teodoro Alamo, David Muñoz de la Peñ...
AMC
2005
242views more  AMC 2005»
13 years 8 months ago
A hybrid method for solving stochastic job shop scheduling problems
Reza Tavakkoli-Moghaddam, Fariborz Jolai, F. Vazir...
JCT
2007
95views more  JCT 2007»
13 years 8 months ago
Codegree problems for projective geometries
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