Pages that link to "Item:Q4206784"
From MaRDI portal
The following pages link to Maximum matching of given weight in complete and complete bipartite graphs (Q4206784):
Displayed 16 items.
- On generalized balanced optimization problems (Q627450) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Adjacency on the constrained assignment problem (Q1270787) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- Cooperation in Multiorganization Matching (Q3602831) (← links)
- Finding the set of alternatives in discrete multicriterion problems (Q3812058) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- Bicolored matchings in some classes of graphs (Q5899324) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Filling crosswords is very hard (Q6199399) (← links)