763 search results - page 62 / 153 » Programming and Planning |
120
click to vote
EOR
2000
15 years 3 months ago
2000
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...
149
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
131
click to vote
SIGCSE
2009
ACM
16 years 3 months ago
2009
ACM
This paper considers how gaming has been infused into the computing curriculum of institutions in the United States. To increase motivation of students and improve retention, many...
125
click to vote
ATMOS
2007
15 years 4 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
121
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...