The Complexity of Timetable Construction Problems

Description

Abstract: "This paper shows that timetable construction is NP- complete in a number of quite different ways that arise in practice, and discusses the prospects of overcoming these problems. A formal specification of the problem based on TTL, a timetable specification language, is given."

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Similar books

• 

  组合优化

  By 库克, William J. Cook, 李学良

  本书内容包括:问题和算法,最优树和最优路,最大流问题,最小费用流问题,最优匹配,多面体的整性,旅游售货商问题,拟阵等.

• 

  Handbook of combinatorial optimization & probability theory

  Handbook of combinatorial optimization & probability theory

• 

  Handbook of Combinatorial Optimization and Probability Theory

  By Louisa A. May

  This handbook provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization, with discrete optimization problems for points in Euclidean space, such as the minimum ...

• 

  Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings

  By Karen Aardal

  This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022.

• 

  Handbook of combinatorial optimization. 1

  By Panos M. Pardalos, Dingzhu Du

  In the following it is assumed that the reader is familiar with the concepts of the complexity classes classes P and NP and with elementary concepts from probability theory . 4.1 Definitions and basic results First of all , let us ...

• 

  Recherche opérationnelle pour ingénieurs

  By Thomas M. Liebling, Dominique de Werra, Jean-François Hêche

  Permettant la conception et l'entretien de systèmes logistiques et techniques toujours plus complexes, la recherche opérationnelle fait aujourd'hui partie du bagage essentiel à tout ingénieur.