Sciweavers

1707 search results - page 68 / 342
» Early Integer Programming
Sort
View
EOR
2008
110views more  EOR 2008»
14 years 10 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
MP
2006
119views more  MP 2006»
14 years 9 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
DISOPT
2011
175views Education» more  DISOPT 2011»
14 years 1 months ago
Strengthening lattice-free cuts using non-negativity
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
Ricardo Fukasawa, Oktay Günlük
OOPSLA
2004
Springer
15 years 3 months ago
Event-driven programming facilitates learning standard programming concepts
We have designed a CS 1 course that integrates event-driven programming from the very start. In [2] we argued that event-driven programming is simple enough for CS 1 when introduc...
Kim B. Bruce, Andrea Pohoreckyj Danyluk
ICALP
2003
Springer
15 years 3 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...