Sciweavers

91 search results - page 4 / 19
» A dynamic inequality generation scheme for polynomial progra...
Sort
View
SIAMJO
2008
100views more  SIAMJO 2008»
15 years 1 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 3 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
EOR
2010
88views more  EOR 2010»
15 years 1 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
15 years 1 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 8 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert