327 search results - page 48 / 66 » Cutting planes in integer and mixed integer programming |
115
click to vote
ATMOS
2007
15 years 2 months ago
2007
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
162
click to vote
CPAIOR
2010
Springer
14 years 11 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
193
click to vote
DC
2011
14 years 1 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
114
click to vote
WSC
2000
15 years 2 months ago
2000
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
124
click to vote
CCO
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...