3221 search results - page 81 / 645 » Termination of Linear Programs |
IOR
2006
13 years 8 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
CP
2010
Springer
13 years 6 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
MP
2011
12 years 10 months ago
2011
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
VLSID
2002
IEEE
14 years 8 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
GECCO
2009
Springer
14 years 18 days ago
2009
Springer
The notion of evolvability has been put forward to describe the“core mechanism”of natural and artificial evolution. Recently, studies have revealed the influence of the envi...