The following pages link to (Q4437514):
Displaying 5 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
- Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
- To stop or not to stop: a time-constrained trip covering location problem on a tree network (Q2675712) (← links)
