Sciweavers

489 search results - page 9 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
4OR
2006
100views more  4OR 2006»
13 years 7 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
COR
2010
105views more  COR 2010»
13 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
14 years 1 months ago
An ILP Formulation for Yield-driven Architectural Synthesis
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
CISS
2008
IEEE
14 years 2 months ago
A linear integer programming approach to analyze P2P media streaming
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
Fulu Li, Jianwei Huang, Andrew Lippman
PLDI
2000
ACM
14 years 3 days ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan