158 search results - page 6 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
COR
2010
13 years 7 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
TVCG
2011
13 years 2 months ago
2011
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
MP
2010
13 years 6 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
IPCO
2007
13 years 9 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
AUSSOIS
2001
Springer
14 years 4 days ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...