Sciweavers

2976 search results - page 78 / 596
» On the bounded integer programming
Sort
View
129
Voted
OSN
2007
185views more  OSN 2007»
14 years 12 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
COLT
1999
Springer
15 years 4 months ago
Learning Threshold Functions with Small Weights Using Membership Queries
We study the learnability of Threshold functions with bounded weights using membership queries only. We show that the class Ct of Threshold functions with positive integer weights...
Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar ...
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
16 years 26 days ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
IPCO
2001
117views Optimization» more  IPCO 2001»
15 years 1 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 10 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...