2976 search results - page 88 / 596 » On the bounded integer programming |
86
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
106
Voted
IOR
2007
15 years 13 days ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
CCE
2005
15 years 12 days ago
2005
This paper presents a continuous-time mathematical formulation for freshwater and wastewater minimisation in multipurpose batch plants with and without a central reusable water st...
111
click to vote
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
122
click to vote
DCG
2011
14 years 7 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...