Sciweavers

60 search results - page 7 / 12
» A column generation approach to capacitated p-median problem...
Sort
View
COR
2008
142views more  COR 2008»
13 years 10 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 11 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
CP
2009
Springer
14 years 11 months ago
Generating Optimal Stowage Plans for Container Vessel Bays
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
Alberto Delgado, Christian Schulte, Rune Mø...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 18 days ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 9 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...