Scalability issues in optimal assignment for carpooling
DOI10.1016/j.jcss.2014.11.010zbMath1319.68238MaRDI QIDQ2254279
Luk Knapen, Geert Wets, Tom Bellemans, Irith Ben-Arroyo Hartman, Sung Jin Cho, Davy Janssens, Daniel Keren, Ansar-Ul-Haque Yasar
Publication date: 4 February 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.11.010
learning; graph theory; scalability; dynamic networks; agent-based modeling; star forest; star partition; activity-based model
90C35: Programming involving graphs or networks
68T05: Learning and adaptive systems in artificial intelligence
68U99: Computing methodologies and applications
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work