Model And Combinatorial Optimization Methods For Tactical Planning In Closed-Loop Supply Chains | 0 | 0.34 | 2016 |
A Decomposition Approach for Discovering Discriminative Motifs in a Sequence Database | 0 | 0.34 | 2014 |
Developing approaches for solving a telecommunications feature subscription problem | 0 | 0.34 | 2014 |
Using local alignments for relation recognition | 2 | 0.36 | 2010 |
Context-sensitive call control using constraints and rules | 1 | 0.38 | 2010 |
Improving the Global Constraint SoftPrec | 0 | 0.34 | 2010 |
A soft global precedence constraint | 3 | 0.53 | 2009 |
Solving a Telecommunications Feature Subscription Configuration Problem | 5 | 0.60 | 2008 |
Personalisation of telecommunications services as combinatorial optimisation | 3 | 0.43 | 2008 |
Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription | 3 | 0.48 | 2008 |
Aspects and Constraints for Implementing Configurable Product-Line Architectures | 1 | 0.36 | 2004 |
Aspects for Synthesizing Applications by Refinement | 1 | 0.36 | 2004 |
Inferring Constraint Types in Constraint Programming | 4 | 0.63 | 2002 |
iOpt: A Software Toolkit for Heuristic Search Methods | 21 | 1.28 | 2001 |
Dynamic Workforce Scheduling for British Telecommunications plc | 18 | 1.37 | 2000 |
Maximal Sets of Solutions for Constraint Satisfaction Problems | 9 | 0.67 | 1994 |