( en | de | ru )

 

Disambiguation of "Pape, Claude Le"

Author of the publication

copydeleteadd this publication to your clipboard
Solving a Network Design Problem.

, , , and . Ann. Oper. Res., 130 (1-4): 217-239 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Claude Le Nénaon

Le Le Win

Claude Imobersteg

Claude Haan

Claude Muller

 

Other publications of authors with the same name

Solving a Network Design Problem., , , and . Ann. Oper. Res., 130 (1-4): 217-239 (2004)Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems., , and . Ann. Oper. Res., (1999)Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem., and . J. Heuristics, 5 (3): 305-325 (1999)Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case., and . ECAI, page 619-623. John Wiley and Sons, Chichester, (1996)Adapting the behavior of a job-shop scheduling system., and . Decis. Support Syst., 7 (4): 341-353 (1991)Management of Temporal Constraints for Factory Scheduling., and . Temporal Aspects in Information Systems, page 159-170. North-Holland / Elsevier, (1987)A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling., and . IJCAI (1), page 600-606. Morgan Kaufmann, (1995)Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints., , and . CP, volume 1520 of Lecture Notes in Computer Science, page 87-101. Springer, (1998)Simulating actions and perception of autonomous mobile robots in a multi-agent indoor environment., and . IROS, page 1479-1484. IEEE, (1991)Constraint propagation for ordering, abstraction, and aggregation relations.. J. Exp. Theor. Artif. Intell., 10 (1): 63-76 (1998)