Sciweavers

2976 search results - page 98 / 596
» On the bounded integer programming
Sort
View
MP
2010
81views more  MP 2010»
14 years 11 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
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...
Jean-Philippe P. Richard, Mohit Tawarmalani
IPL
2007
111views more  IPL 2007»
15 years 13 days ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
94
Voted
ARC
2009
Springer
137views Hardware» more  ARC 2009»
15 years 7 months ago
Heterogeneous Architecture Exploration: Analysis vs. Parameter Sweep
This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization t...
Asma Kahoul, George A. Constantinides, Alastair M....
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 6 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
PATAT
2004
Springer
135views Education» more  PATAT 2004»
15 years 5 months ago
A Column Generation Scheme for Faculty Timetabling
In this paper we deal with the problem of building a timetable for the courses of a university faculty. We propose an integer linear programming approach based on column generation...
Andrea Qualizza, Paolo Serafini