Pages that link to "Item:Q2192065"
From MaRDI portal
The following pages link to The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065):
Displaying 6 items.
- Energy-efficient timetabling in a German underground system (Q2086323) (← links)
- Set characterizations and convex extensions for geometric convex-hull proofs (Q2089779) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- EETTlib—Energy‐efficient train timetabling library (Q6179702) (← links)
