47 search results - page 2 / 10 » Automated Configuration of Mixed Integer Programming Solvers |
ICTAI
2010
IEEE
13 years 2 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 ...
IJON
2008
13 years 4 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...
INFORMS
2006
13 years 4 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...
DAC
2009
ACM
14 years 5 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...
CAEPIA
2011
Springer
12 years 4 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 ...