Sciweavers

274 search results - page 17 / 55
» Watermarking integer linear programming solutions
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
CATS
2008
13 years 9 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
JISE
2006
76views more  JISE 2006»
13 years 7 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
TRANSCI
2008
122views more  TRANSCI 2008»
13 years 7 months ago
Scheduling Locomotives and Car Transfers in Freight Transport
Abstract. We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation th...
Armin Fügenschuh, Henning Homfeld, Andreas Hu...
CP
2004
Springer
14 years 28 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker