The following pages link to (Q2847386):
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)
- Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
- Covering a line segment with variable radius discs (Q960389) (← links)
- To stop or not to stop: a time-constrained trip covering location problem on a tree network (Q2675712) (← links)
