Pages that link to "Item:Q1626726"
From MaRDI portal
The following pages link to Three-dimensional matching instances are rich in stable matchings (Q1626726):
Displaying 13 items.
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- Three-dimensional stable matching with hybrid preferences (Q1740420) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding (Q2117205) (← links)
- SeaPearl: a constraint programming solver guided by reinforcement learning (Q2117242) (← links)
- Improving branch-and-bound using decision diagrams and reinforcement learning (Q2117248) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences (Q2197901) (← links)
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences (Q2700602) (← links)
- (Q5020990) (← links)
- Three-dimensional stable matching with cyclic preferences (Q5898285) (← links)
- On the existence of three-dimensional stable matchings with cyclic preferences (Q5918706) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)