( en | de | ru )

 

Disambiguation of "Schutt, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Not-First and Not-Last Detection for Cumulative Scheduling in O(n3logn).

, , and . INAP, volume 4369 of Lecture Notes in Computer Science, page 66-80. Springer, (2005)

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.

Hermann Schutt

Erwin Schütt

Gudrun Schütt

Bernd Schütt

Michael Schütt

 

Other publications of authors with the same name

Modelling with Option Types in MiniZinc., , , , , and . CPAIOR, volume 8451 of Lecture Notes in Computer Science, page 88-103. Springer, (2014)Aggregation and Garbage Collection for Online Optimization., , , , and . CP, volume 12333 of Lecture Notes in Computer Science, page 231-247. Springer, (2020)Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint., , and . CPAIOR, volume 7874 of Lecture Notes in Computer Science, page 234-250. Springer, (2013)Time Table Edge Finding with Energy Variables., , and . CPAIOR, volume 11494 of Lecture Notes in Computer Science, page 633-642. Springer, (2019)Solver-Independent Large Neighbourhood Search., , , , and . CP, volume 11008 of Lecture Notes in Computer Science, page 81-98. Springer, (2018)Explaining Producer/Consumer Constraints., and . CP, volume 9892 of Lecture Notes in Computer Science, page 438-454. Springer, (2016)Not-First and Not-Last Detection for Cumulative Scheduling in O(n3logn)., , and . INAP, volume 4369 of Lecture Notes in Computer Science, page 66-80. Springer, (2005)Solver Independent Rotating Workforce Scheduling., , and . CPAIOR, volume 10848 of Lecture Notes in Computer Science, page 429-445. Springer, (2018)A New O(n2logn) Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints., and . CP, volume 6308 of Lecture Notes in Computer Science, page 445-459. Springer, (2010)Incremental Satisfiability and Implication for UTVPI Constraints., and . INFORMS J. Comput., 22 (4): 514-527 (2010)