Sciweavers

2976 search results - page 57 / 596
» On the bounded integer programming
Sort
View
OL
2007
156views more  OL 2007»
13 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
IPCO
2007
109views Optimization» more  IPCO 2007»
13 years 11 months ago
Inequalities from Two Rows of a Simplex Tableau
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
Kent Andersen, Quentin Louveaux, Robert Weismantel...
WDAG
2004
Springer
113views Algorithms» more  WDAG 2004»
14 years 3 months ago
Bounded Version Vectors
Abstract. Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated dat...
José Bacelar Almeida, Paulo Sérgio A...
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 10 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 4 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...