Pages that link to "Item:Q1090343"
From MaRDI portal
The following pages link to Algorithms for finding k-best perfect matchings (Q1090343):
Displaying 21 items.
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- Finding all the perfect matchings in bipartite graphs (Q1324433) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- A note on \(K\) best network flows (Q1897375) (← links)
- Heuristic enhancements of the search for the generation of all perfect matchings (Q1921169) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
- Two phase algorithms for the bi-objective assignment problem (Q2455615) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems (Q2655619) (← links)
- k-Best constrained bases of a matroid (Q3470256) (← links)
- (Q5111875) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
- A fuzzy model for NMT word alignment using quasi-perfect matching (Q6184809) (← links)
