Sciweavers

1707 search results - page 41 / 342
» Early Integer Programming
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 2 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
OL
2007
156views more  OL 2007»
13 years 10 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»
14 years 12 days 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...
BIRTHDAY
2006
Springer
14 years 2 months ago
Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
Roberto Cordeschi
ECOOP
2006
Springer
14 years 2 months ago
Early Concurrent/Mobile Objects
Abstract. This essay just sketches my early investigations on the concept of objects which models concurrent activities of mobile entities that interact with each other in space. 1...
Akinori Yonezawa