327 search results - page 20 / 66 » Cutting planes in integer and mixed integer programming |
111
click to vote
MP
2008
15 years 1 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
109
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
129
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
103
click to vote
DAM
2006
15 years 1 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
MP
2010
14 years 11 months ago
2010
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...