41 search results - page 8 / 9 » On Using Cutting Planes in Pseudo-Boolean Optimization |
EOR
2006
13 years 5 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
KDD
2008
ACM
14 years 6 months ago
2008
ACM
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
DAM
2006
13 years 5 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
WEA
2010
Springer
14 years 17 days ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
INFOCOM
1998
IEEE
13 years 10 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...