729 search results - page 69 / 146 » Solving subgraph isomorphism problems with constraint progra... |
180
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
136
click to vote
ESORICS
2010
Springer
15 years 3 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
139
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
146
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
97
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...