Sciweavers

SIAMJO
2010
47views more  SIAMJO 2010»
13 years 5 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
EOR
2007
78views more  EOR 2007»
13 years 11 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
MOR
2008
94views more  MOR 2008»
13 years 11 months ago
Parametric Integer Programming in Fixed Dimension
We consider the following problem: Given a rational matrix A Qm
Friedrich Eisenbrand, Gennady Shmonin
DISOPT
2007
109views more  DISOPT 2007»
13 years 11 months ago
Sequential pairing of mixed integer inequalities
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 12 days ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
IEEEPACT
2005
IEEE
14 years 4 months ago
Instruction Based Memory Distance Analysis and its Application
Feedback-directed Optimization has become an increasingly important tool in designing and building optimizing compilers as itprovides a means to analyze complexprogram behavior th...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...
CPAIOR
2007
Springer
14 years 5 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
COCOA
2007
Springer
14 years 5 months ago
Fundamental Domains for Integer Programs with Symmetries
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
Eric J. Friedman
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta