266 search results - page 14 / 54 » MIPS |
JASIS
2007
13 years 7 months ago
2007
This paper presents results from twenty-one semi-structured interviews with museum information professionals (MIPs) who were asked about their experiences working with information...
GD
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
ICTAI
1999
IEEE
14 years 6 days ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
MP
2010
13 years 6 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...