Sciweavers

3591 search results - page 272 / 719
» Typing linear constraints
Sort
View
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 7 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
Neal E. Young
170
Voted
MOC
1998
65views more  MOC 1998»
15 years 7 months ago
A natural lattice basis problem with applications
Integer lattices have numerous important applications, but some of them may have been overlooked because of the common assumption that a lattice basis is part of the problem instan...
John D. Hobby
ICML
2003
IEEE
16 years 8 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...
ISMVL
2003
IEEE
80views Hardware» more  ISMVL 2003»
16 years 16 days ago
Augmented Sifting of Multiple-Valued Decision Diagrams
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent var...
D. Michael Miller, Rolf Drechsler
ANOR
2008
93views more  ANOR 2008»
15 years 7 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke