Sciweavers

158 search results - page 10 / 32
» Solving Sequential Mixed Auctions with Integer Programming
Sort
View
IAT
2003
IEEE
14 years 28 days ago
SIMPLE - A Multi-Agent System for Simultaneous and Related Auctions
This work describes a multi-agent architecture and strategy for trade in simultaneous and related auctions. The proposed SIMPLE Agency combines an integer programming model, machi...
Ruy Luiz Milidiú, Taciana Melcop, Frederico...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
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 ...
Gerald Gamrath, Marco E. Lübbecke
COLOGNETWENTE
2009
13 years 8 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
EOR
2008
110views more  EOR 2008»
13 years 7 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
OL
2007
156views more  OL 2007»
13 years 7 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski