Finding cliques of maximum weight on a generalization of permutation graphs

DOI10.1007/s11590-011-0416-xzbMath1267.90161OpenAlexW2068534297MaRDI QIDQ1940437

Alberto Caprara, Valentina Cacchiani, Paolo Toth

Publication date: 7 March 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0416-x

zbMATH Keywords

dynamic programmingtrain timetablingpermutation graphmaximum-weight clique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Dynamic programming (90C39)

Related Items (1)

A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing

Cites Work

• Unnamed Item
• Non-cyclic train timetabling and comparability graphs
• Algorithmic graph theory and perfect graphs
• Railway Timetabling Using Lagrangian Relaxation

This page was built for publication: Finding cliques of maximum weight on a generalization of permutation graphs