Sciweavers

79 search results - page 5 / 16
» On the Relaxation of n-detect Test Sets
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
OL
2007
156views more  OL 2007»
14 years 9 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
MP
2010
92views more  MP 2010»
14 years 4 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
HAPTICS
2010
IEEE
14 years 8 months ago
Force-Based Calibration of a Particle System for Realistic Simulation of Nonlinear and Viscoelastic Soft Tissue Behavior
We present a new approach for realistic visio-haptic simulation of nonlinear and viscoelastic behavior of an organ tissue using a particle model. The spring and damper coefficients...
Bektas Baybora Baran, Cagatay Basdogan
91
Voted
JUCS
2006
107views more  JUCS 2006»
14 years 9 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig