Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new algorithm for the quasi-assignment problem

From MaRDI portal
Publication:808992
Jump to:navigation, search

DOI10.1007/BF02216824zbMath0731.90048OpenAlexW1969435668MaRDI QIDQ808992

Tiantai Song, Li Zhou

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02216824


zbMATH Keywords

bus schedulingquasi-assignment problemsuccessive shortest path algorithmtourist guide problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (2)

A decision support system for the single-depot vehicle rescheduling problem ⋮ Parallel Auction Algorithm for Bus Rescheduling



Cites Work

  • A note on two problems in connexion with graphs
  • A quasi-assignment algorithm for bus scheduling
  • Augmented Threaded Index Method For Network Optimization


This page was built for publication: A new algorithm for the quasi-assignment problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:808992&oldid=12737725"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki