47 search results - page 2 / 10 » Automated Configuration of Mixed Integer Programming Solvers |
99
Voted
ICTAI
2010
IEEE
14 years 9 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
69
Voted
IJON
2008
14 years 11 months ago
2008
We describe here a method for building a support vector machine (SVM) with integer parameters. Our method is based on a branchand-bound procedure, derived from modern mixed intege...
84
Voted
INFORMS
2006
14 years 11 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
90
Voted
DAC
2009
ACM
15 years 12 months ago
2009
ACM
Retiming and recycling are two transformations used to optimize the performance of latency-insensitive (a.k.a. synchronous elastic) systems. This paper presents an approach that c...
160
click to vote
CAEPIA
2011
Springer
13 years 11 months ago
2011
Springer
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...